./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/popl20-two-queue.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 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:47:11,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:47:12,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:47:12,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:47:12,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:47:12,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:47:12,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:47:12,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:47:12,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:47:12,049 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:47:12,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:47:12,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:47:12,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:47:12,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:47:12,049 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:47:12,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:47:12,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:47:12,050 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:47:12,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:47:12,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:47:12,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:47:12,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:47:12,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:47:12,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:47:12,050 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:47:12,050 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:47:12,050 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:47:12,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:47:12,050 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:47:12,050 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:47:12,050 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:47:12,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:47:12,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:47:12,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:47:12,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:47:12,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:47:12,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:47:12,051 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:47:12,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:47:12,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:47:12,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:47:12,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:47:12,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:47:12,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:47:12,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:47:12,052 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 -> 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 [2025-03-17 19:47:12,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:47:12,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:47:12,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:47:12,278 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:47:12,279 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:47:12,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-03-17 19:47:13,418 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89901dcbc/6b2bf09d93984050aa58dc3d5262f49a/FLAGeda330662 [2025-03-17 19:47:13,639 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:47:13,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-03-17 19:47:13,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89901dcbc/6b2bf09d93984050aa58dc3d5262f49a/FLAGeda330662 [2025-03-17 19:47:13,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89901dcbc/6b2bf09d93984050aa58dc3d5262f49a [2025-03-17 19:47:13,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:47:13,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:47:13,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:47:13,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:47:13,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:47:13,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:47:13" (1/1) ... [2025-03-17 19:47:13,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47affade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:47:13, skipping insertion in model container [2025-03-17 19:47:13,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:47:13" (1/1) ... [2025-03-17 19:47:13,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:47:13,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:47:13,818 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:47:13,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:47:13,852 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:47:13,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:47:13 WrapperNode [2025-03-17 19:47:13,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:47:13,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:47:13,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:47:13,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:47:13,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:47:13" (1/1) ... [2025-03-17 19:47:13,863 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:47:13" (1/1) ... [2025-03-17 19:47:13,886 INFO L138 Inliner]: procedures = 23, calls = 34, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 204 [2025-03-17 19:47:13,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:47:13,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:47:13,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:47:13,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:47:13,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:47:13" (1/1) ... [2025-03-17 19:47:13,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:47:13" (1/1) ... [2025-03-17 19:47:13,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:47:13" (1/1) ... [2025-03-17 19:47:13,913 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 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-17 19:47:13,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:47:13" (1/1) ... [2025-03-17 19:47:13,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:47:13" (1/1) ... [2025-03-17 19:47:13,918 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:47:13" (1/1) ... [2025-03-17 19:47:13,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:47:13" (1/1) ... [2025-03-17 19:47:13,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:47:13" (1/1) ... [2025-03-17 19:47:13,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:47:13" (1/1) ... [2025-03-17 19:47:13,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:47:13,927 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:47:13,927 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:47:13,927 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:47:13,928 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:47:13" (1/1) ... [2025-03-17 19:47:13,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:47:13,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:13,951 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-17 19:47:13,953 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-17 19:47:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:47:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 19:47:13,970 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 19:47:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 19:47:13,970 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 19:47:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:47:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:47:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:47:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:47:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 19:47:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 19:47:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:47:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:47:13,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:47:13,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:47:13,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:47:13,971 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 19:47:14,044 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:47:14,045 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:47:14,312 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 19:47:14,313 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:47:14,483 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:47:14,483 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:47:14,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:47:14 BoogieIcfgContainer [2025-03-17 19:47:14,484 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:47:14,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:47:14,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:47:14,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:47:14,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:47:13" (1/3) ... [2025-03-17 19:47:14,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0b0501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:47:14, skipping insertion in model container [2025-03-17 19:47:14,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:47:13" (2/3) ... [2025-03-17 19:47:14,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0b0501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:47:14, skipping insertion in model container [2025-03-17 19:47:14,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:47:14" (3/3) ... [2025-03-17 19:47:14,492 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2025-03-17 19:47:14,509 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:47:14,510 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-two-queue.wvr.c that has 3 procedures, 47 locations, 1 initial locations, 4 loop locations, and 16 error locations. [2025-03-17 19:47:14,510 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 19:47:14,555 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 19:47:14,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 50 transitions, 114 flow [2025-03-17 19:47:14,622 INFO L124 PetriNetUnfolderBase]: 4/48 cut-off events. [2025-03-17 19:47:14,625 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 19:47:14,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 48 events. 4/48 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-03-17 19:47:14,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 50 transitions, 114 flow [2025-03-17 19:47:14,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 46 transitions, 101 flow [2025-03-17 19:47:14,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:47:14,645 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;@14cc473b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:47:14,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-17 19:47:14,649 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:47:14,650 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-17 19:47:14,650 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:47:14,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:14,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 19:47:14,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:14,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:14,656 INFO L85 PathProgramCache]: Analyzing trace with hash 569296, now seen corresponding path program 1 times [2025-03-17 19:47:14,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:14,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255391588] [2025-03-17 19:47:14,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:14,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:14,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:47:14,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:47:14,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:14,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:14,860 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-17 19:47:14,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:14,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255391588] [2025-03-17 19:47:14,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255391588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:14,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:14,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:47:14,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805359503] [2025-03-17 19:47:14,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:14,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:47:14,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:14,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:47:14,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:47:14,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-03-17 19:47:14,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-17 19:47:14,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:14,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-03-17 19:47:14,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:15,072 INFO L124 PetriNetUnfolderBase]: 215/476 cut-off events. [2025-03-17 19:47:15,073 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 19:47:15,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 476 events. 215/476 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2544 event pairs, 128 based on Foata normal form. 2/341 useless extension candidates. Maximal degree in co-relation 755. Up to 338 conditions per place. [2025-03-17 19:47:15,077 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 27 selfloop transitions, 7 changer transitions 0/48 dead transitions. [2025-03-17 19:47:15,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 173 flow [2025-03-17 19:47:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:47:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:47:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-17 19:47:15,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53 [2025-03-17 19:47:15,089 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 101 flow. Second operand 4 states and 106 transitions. [2025-03-17 19:47:15,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 173 flow [2025-03-17 19:47:15,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:47:15,095 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 148 flow [2025-03-17 19:47:15,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2025-03-17 19:47:15,101 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2025-03-17 19:47:15,101 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 148 flow [2025-03-17 19:47:15,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-17 19:47:15,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:15,101 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 19:47:15,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:47:15,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:15,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:15,102 INFO L85 PathProgramCache]: Analyzing trace with hash -219458490, now seen corresponding path program 1 times [2025-03-17 19:47:15,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:15,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070334073] [2025-03-17 19:47:15,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:15,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:15,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:47:15,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:47:15,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:15,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:15,212 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-17 19:47:15,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:15,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070334073] [2025-03-17 19:47:15,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070334073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:15,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865754248] [2025-03-17 19:47:15,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:15,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:15,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:15,215 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-17 19:47:15,217 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-17 19:47:15,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:47:15,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:47:15,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:15,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:15,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:47:15,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:15,314 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-17 19:47:15,314 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:47:15,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865754248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:15,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:47:15,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 19:47:15,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154744000] [2025-03-17 19:47:15,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:15,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:47:15,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:15,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:47:15,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:47:15,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-03-17 19:47:15,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:47:15,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:15,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-03-17 19:47:15,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:15,494 INFO L124 PetriNetUnfolderBase]: 215/474 cut-off events. [2025-03-17 19:47:15,494 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-17 19:47:15,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 474 events. 215/474 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2523 event pairs, 128 based on Foata normal form. 2/342 useless extension candidates. Maximal degree in co-relation 806. Up to 328 conditions per place. [2025-03-17 19:47:15,499 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 20 selfloop transitions, 12 changer transitions 0/46 dead transitions. [2025-03-17 19:47:15,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 204 flow [2025-03-17 19:47:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:47:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:47:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2025-03-17 19:47:15,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2025-03-17 19:47:15,502 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 148 flow. Second operand 6 states and 130 transitions. [2025-03-17 19:47:15,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 204 flow [2025-03-17 19:47:15,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 204 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:47:15,504 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 164 flow [2025-03-17 19:47:15,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-03-17 19:47:15,504 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2025-03-17 19:47:15,506 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 164 flow [2025-03-17 19:47:15,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:47:15,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:15,506 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 19:47:15,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 19:47:15,709 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-17 19:47:15,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:15,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:15,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1786721917, now seen corresponding path program 1 times [2025-03-17 19:47:15,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:15,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882510441] [2025-03-17 19:47:15,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:15,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:15,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:47:15,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:47:15,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:15,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:15,789 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-17 19:47:15,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:15,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882510441] [2025-03-17 19:47:15,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882510441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:15,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259177882] [2025-03-17 19:47:15,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:15,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:15,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:15,791 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-17 19:47:15,793 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-17 19:47:15,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:47:15,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:47:15,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:15,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:15,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:47:15,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:15,862 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-17 19:47:15,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:15,896 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-17 19:47:15,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259177882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:15,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:15,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-17 19:47:15,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527970981] [2025-03-17 19:47:15,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:15,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 19:47:15,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:15,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:47:15,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:47:15,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-03-17 19:47:15,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 164 flow. Second operand has 12 states, 12 states have (on average 17.083333333333332) internal successors, (205), 12 states have internal predecessors, (205), 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-17 19:47:15,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:15,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-03-17 19:47:15,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:16,080 INFO L124 PetriNetUnfolderBase]: 221/498 cut-off events. [2025-03-17 19:47:16,080 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-17 19:47:16,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 498 events. 221/498 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2697 event pairs, 128 based on Foata normal form. 6/369 useless extension candidates. Maximal degree in co-relation 808. Up to 339 conditions per place. [2025-03-17 19:47:16,083 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 25 selfloop transitions, 25 changer transitions 0/64 dead transitions. [2025-03-17 19:47:16,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 378 flow [2025-03-17 19:47:16,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:47:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 19:47:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 216 transitions. [2025-03-17 19:47:16,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.432 [2025-03-17 19:47:16,086 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 164 flow. Second operand 10 states and 216 transitions. [2025-03-17 19:47:16,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 378 flow [2025-03-17 19:47:16,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 64 transitions, 320 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-17 19:47:16,088 INFO L231 Difference]: Finished difference. Result has 58 places, 64 transitions, 304 flow [2025-03-17 19:47:16,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=304, PETRI_PLACES=58, PETRI_TRANSITIONS=64} [2025-03-17 19:47:16,089 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2025-03-17 19:47:16,089 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 64 transitions, 304 flow [2025-03-17 19:47:16,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.083333333333332) internal successors, (205), 12 states have internal predecessors, (205), 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-17 19:47:16,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:16,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:16,096 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-17 19:47:16,294 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-17 19:47:16,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:16,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:16,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1823072409, now seen corresponding path program 1 times [2025-03-17 19:47:16,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:16,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140077055] [2025-03-17 19:47:16,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:16,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:16,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:47:16,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:47:16,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:16,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:16,372 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-17 19:47:16,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:16,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140077055] [2025-03-17 19:47:16,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140077055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:16,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:16,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:47:16,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142702268] [2025-03-17 19:47:16,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:16,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:47:16,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:16,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:47:16,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:47:16,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-17 19:47:16,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 64 transitions, 304 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-17 19:47:16,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:16,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-17 19:47:16,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:16,482 INFO L124 PetriNetUnfolderBase]: 238/546 cut-off events. [2025-03-17 19:47:16,482 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-03-17 19:47:16,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 546 events. 238/546 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2943 event pairs, 146 based on Foata normal form. 13/424 useless extension candidates. Maximal degree in co-relation 989. Up to 350 conditions per place. [2025-03-17 19:47:16,486 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 48 selfloop transitions, 7 changer transitions 2/73 dead transitions. [2025-03-17 19:47:16,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 440 flow [2025-03-17 19:47:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:47:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:47:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-03-17 19:47:16,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-17 19:47:16,492 INFO L175 Difference]: Start difference. First operand has 58 places, 64 transitions, 304 flow. Second operand 4 states and 120 transitions. [2025-03-17 19:47:16,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 440 flow [2025-03-17 19:47:16,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 416 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-17 19:47:16,496 INFO L231 Difference]: Finished difference. Result has 60 places, 64 transitions, 303 flow [2025-03-17 19:47:16,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=303, PETRI_PLACES=60, PETRI_TRANSITIONS=64} [2025-03-17 19:47:16,496 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2025-03-17 19:47:16,497 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 64 transitions, 303 flow [2025-03-17 19:47:16,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-17 19:47:16,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:16,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:16,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:47:16,498 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:16,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:16,499 INFO L85 PathProgramCache]: Analyzing trace with hash -417538630, now seen corresponding path program 1 times [2025-03-17 19:47:16,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:16,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927011627] [2025-03-17 19:47:16,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:16,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:16,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:47:16,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:47:16,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:16,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:16,606 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-17 19:47:16,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:16,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927011627] [2025-03-17 19:47:16,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927011627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:16,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:16,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:47:16,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787942370] [2025-03-17 19:47:16,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:16,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:47:16,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:16,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:47:16,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:47:16,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-17 19:47:16,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 64 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:47:16,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:16,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-17 19:47:16,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:16,726 INFO L124 PetriNetUnfolderBase]: 269/651 cut-off events. [2025-03-17 19:47:16,727 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-03-17 19:47:16,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 651 events. 269/651 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3672 event pairs, 174 based on Foata normal form. 12/516 useless extension candidates. Maximal degree in co-relation 1296. Up to 396 conditions per place. [2025-03-17 19:47:16,730 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 64 selfloop transitions, 4 changer transitions 4/88 dead transitions. [2025-03-17 19:47:16,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 571 flow [2025-03-17 19:47:16,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:47:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:47:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2025-03-17 19:47:16,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.584 [2025-03-17 19:47:16,731 INFO L175 Difference]: Start difference. First operand has 60 places, 64 transitions, 303 flow. Second operand 5 states and 146 transitions. [2025-03-17 19:47:16,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 571 flow [2025-03-17 19:47:16,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 88 transitions, 564 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:47:16,737 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 328 flow [2025-03-17 19:47:16,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2025-03-17 19:47:16,738 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2025-03-17 19:47:16,739 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 328 flow [2025-03-17 19:47:16,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:47:16,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:16,739 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:16,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:47:16,740 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:16,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:16,740 INFO L85 PathProgramCache]: Analyzing trace with hash 139672149, now seen corresponding path program 1 times [2025-03-17 19:47:16,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:16,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892140125] [2025-03-17 19:47:16,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:16,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:16,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:47:16,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:47:16,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:16,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:16,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:16,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892140125] [2025-03-17 19:47:16,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892140125] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:16,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125091498] [2025-03-17 19:47:16,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:16,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:16,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:16,878 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-17 19:47:16,880 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-17 19:47:16,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:47:16,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:47:16,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:16,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:16,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:47:16,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:47:16,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:47:16,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125091498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:16,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:47:16,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2025-03-17 19:47:16,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609722595] [2025-03-17 19:47:16,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:16,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:47:16,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:16,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:47:16,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:47:16,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-17 19:47:16,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-17 19:47:16,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:16,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-17 19:47:16,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:17,014 INFO L124 PetriNetUnfolderBase]: 196/510 cut-off events. [2025-03-17 19:47:17,015 INFO L125 PetriNetUnfolderBase]: For 174/198 co-relation queries the response was YES. [2025-03-17 19:47:17,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 510 events. 196/510 cut-off events. For 174/198 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2788 event pairs, 124 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 1052. Up to 359 conditions per place. [2025-03-17 19:47:17,018 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 46 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2025-03-17 19:47:17,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 414 flow [2025-03-17 19:47:17,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:47:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:47:17,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-03-17 19:47:17,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.56 [2025-03-17 19:47:17,019 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 328 flow. Second operand 3 states and 84 transitions. [2025-03-17 19:47:17,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 414 flow [2025-03-17 19:47:17,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 401 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 19:47:17,021 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 309 flow [2025-03-17 19:47:17,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=309, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2025-03-17 19:47:17,021 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2025-03-17 19:47:17,022 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 309 flow [2025-03-17 19:47:17,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-17 19:47:17,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:17,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:17,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:47:17,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:17,223 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:17,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:17,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2003578448, now seen corresponding path program 1 times [2025-03-17 19:47:17,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:17,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200898309] [2025-03-17 19:47:17,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:17,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:17,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:47:17,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:47:17,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:17,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:17,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:17,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200898309] [2025-03-17 19:47:17,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200898309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:17,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570002772] [2025-03-17 19:47:17,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:17,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:17,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:17,407 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-17 19:47:17,409 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-17 19:47:17,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:47:17,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:47:17,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:17,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:17,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:47:17,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:47:17,494 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:47:17,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570002772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:17,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:47:17,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-03-17 19:47:17,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046246975] [2025-03-17 19:47:17,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:17,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:47:17,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:17,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:47:17,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:47:17,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-17 19:47:17,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-17 19:47:17,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:17,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-17 19:47:17,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:17,547 INFO L124 PetriNetUnfolderBase]: 142/406 cut-off events. [2025-03-17 19:47:17,548 INFO L125 PetriNetUnfolderBase]: For 151/159 co-relation queries the response was YES. [2025-03-17 19:47:17,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 406 events. 142/406 cut-off events. For 151/159 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2131 event pairs, 88 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 884. Up to 275 conditions per place. [2025-03-17 19:47:17,549 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 43 selfloop transitions, 1 changer transitions 1/61 dead transitions. [2025-03-17 19:47:17,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 61 transitions, 391 flow [2025-03-17 19:47:17,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:47:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:47:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2025-03-17 19:47:17,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2025-03-17 19:47:17,550 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 309 flow. Second operand 3 states and 82 transitions. [2025-03-17 19:47:17,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 61 transitions, 391 flow [2025-03-17 19:47:17,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:47:17,552 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 293 flow [2025-03-17 19:47:17,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=293, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2025-03-17 19:47:17,552 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2025-03-17 19:47:17,553 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 293 flow [2025-03-17 19:47:17,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-17 19:47:17,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:17,553 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-17 19:47:17,559 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-17 19:47:17,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:17,754 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:17,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:17,754 INFO L85 PathProgramCache]: Analyzing trace with hash 463881139, now seen corresponding path program 2 times [2025-03-17 19:47:17,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:17,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644428341] [2025-03-17 19:47:17,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:47:17,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:17,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-17 19:47:17,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-17 19:47:17,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:47:17,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:17,795 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-17 19:47:17,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:17,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644428341] [2025-03-17 19:47:17,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644428341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:17,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408218920] [2025-03-17 19:47:17,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:47:17,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:17,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:17,798 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-17 19:47:17,799 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-17 19:47:17,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-17 19:47:17,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-17 19:47:17,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:47:17,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:17,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:47:17,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:17,875 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-17 19:47:17,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:17,897 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-17 19:47:17,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408218920] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:17,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:17,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-17 19:47:17,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510417876] [2025-03-17 19:47:17,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:17,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:47:17,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:17,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:47:17,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:47:17,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-03-17 19:47:17,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-17 19:47:17,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:17,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-03-17 19:47:17,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:17,971 INFO L124 PetriNetUnfolderBase]: 129/366 cut-off events. [2025-03-17 19:47:17,971 INFO L125 PetriNetUnfolderBase]: For 157/165 co-relation queries the response was YES. [2025-03-17 19:47:17,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 366 events. 129/366 cut-off events. For 157/165 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1822 event pairs, 75 based on Foata normal form. 1/325 useless extension candidates. Maximal degree in co-relation 796. Up to 234 conditions per place. [2025-03-17 19:47:17,974 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 29 selfloop transitions, 16 changer transitions 0/59 dead transitions. [2025-03-17 19:47:17,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 59 transitions, 373 flow [2025-03-17 19:47:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:47:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:47:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-03-17 19:47:17,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43 [2025-03-17 19:47:17,975 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 293 flow. Second operand 4 states and 86 transitions. [2025-03-17 19:47:17,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 59 transitions, 373 flow [2025-03-17 19:47:17,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 59 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:47:17,977 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 314 flow [2025-03-17 19:47:17,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2025-03-17 19:47:17,979 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2025-03-17 19:47:17,979 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 314 flow [2025-03-17 19:47:17,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-17 19:47:17,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:17,979 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:17,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:47:18,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:18,183 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:18,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:18,183 INFO L85 PathProgramCache]: Analyzing trace with hash 833239672, now seen corresponding path program 1 times [2025-03-17 19:47:18,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:18,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386486605] [2025-03-17 19:47:18,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:18,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:18,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:47:18,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:47:18,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:18,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:47:18,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:18,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386486605] [2025-03-17 19:47:18,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386486605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:18,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:18,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:47:18,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820027565] [2025-03-17 19:47:18,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:18,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:47:18,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:18,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:47:18,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:47:18,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-17 19:47:18,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-17 19:47:18,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:18,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-17 19:47:18,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:18,293 INFO L124 PetriNetUnfolderBase]: 119/333 cut-off events. [2025-03-17 19:47:18,293 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-03-17 19:47:18,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 333 events. 119/333 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1544 event pairs, 40 based on Foata normal form. 6/303 useless extension candidates. Maximal degree in co-relation 761. Up to 124 conditions per place. [2025-03-17 19:47:18,295 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 47 selfloop transitions, 2 changer transitions 1/65 dead transitions. [2025-03-17 19:47:18,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 65 transitions, 431 flow [2025-03-17 19:47:18,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:47:18,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:47:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-17 19:47:18,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.58 [2025-03-17 19:47:18,297 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 314 flow. Second operand 3 states and 87 transitions. [2025-03-17 19:47:18,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 65 transitions, 431 flow [2025-03-17 19:47:18,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 399 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:47:18,298 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 296 flow [2025-03-17 19:47:18,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2025-03-17 19:47:18,299 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2025-03-17 19:47:18,300 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 296 flow [2025-03-17 19:47:18,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-17 19:47:18,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:18,300 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-03-17 19:47:18,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 19:47:18,300 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:18,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:18,301 INFO L85 PathProgramCache]: Analyzing trace with hash -999893649, now seen corresponding path program 1 times [2025-03-17 19:47:18,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:18,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768043594] [2025-03-17 19:47:18,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:18,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:18,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 19:47:18,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:47:18,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:18,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:18,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:18,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768043594] [2025-03-17 19:47:18,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768043594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:18,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378162983] [2025-03-17 19:47:18,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:18,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:18,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:18,444 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-17 19:47:18,445 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-17 19:47:18,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 19:47:18,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:47:18,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:18,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:18,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:47:18,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:18,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:18,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378162983] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:18,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:18,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-17 19:47:18,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793711529] [2025-03-17 19:47:18,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:18,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 19:47:18,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:18,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 19:47:18,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-17 19:47:18,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-03-17 19:47:18,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 296 flow. Second operand has 24 states, 24 states have (on average 17.083333333333332) internal successors, (410), 24 states have internal predecessors, (410), 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-17 19:47:18,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:18,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-03-17 19:47:18,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:18,910 INFO L124 PetriNetUnfolderBase]: 137/415 cut-off events. [2025-03-17 19:47:18,911 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2025-03-17 19:47:18,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 415 events. 137/415 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1972 event pairs, 80 based on Foata normal form. 12/373 useless extension candidates. Maximal degree in co-relation 1031. Up to 223 conditions per place. [2025-03-17 19:47:18,912 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 21 selfloop transitions, 61 changer transitions 0/96 dead transitions. [2025-03-17 19:47:18,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 96 transitions, 694 flow [2025-03-17 19:47:18,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 19:47:18,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 19:47:18,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 438 transitions. [2025-03-17 19:47:18,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3981818181818182 [2025-03-17 19:47:18,914 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 296 flow. Second operand 22 states and 438 transitions. [2025-03-17 19:47:18,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 96 transitions, 694 flow [2025-03-17 19:47:18,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 96 transitions, 688 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 19:47:18,918 INFO L231 Difference]: Finished difference. Result has 88 places, 96 transitions, 692 flow [2025-03-17 19:47:18,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=692, PETRI_PLACES=88, PETRI_TRANSITIONS=96} [2025-03-17 19:47:18,919 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 39 predicate places. [2025-03-17 19:47:18,919 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 96 transitions, 692 flow [2025-03-17 19:47:18,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 17.083333333333332) internal successors, (410), 24 states have internal predecessors, (410), 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-17 19:47:18,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:18,920 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:18,927 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-17 19:47:19,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:19,121 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:19,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:19,121 INFO L85 PathProgramCache]: Analyzing trace with hash -826356347, now seen corresponding path program 1 times [2025-03-17 19:47:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:19,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941758305] [2025-03-17 19:47:19,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:19,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:19,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 19:47:19,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:47:19,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:19,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:47:19,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:19,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941758305] [2025-03-17 19:47:19,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941758305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:19,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:19,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:47:19,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140959996] [2025-03-17 19:47:19,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:19,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:47:19,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:19,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:47:19,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:47:19,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-17 19:47:19,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 96 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-17 19:47:19,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:19,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-17 19:47:19,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:19,238 INFO L124 PetriNetUnfolderBase]: 119/365 cut-off events. [2025-03-17 19:47:19,238 INFO L125 PetriNetUnfolderBase]: For 454/454 co-relation queries the response was YES. [2025-03-17 19:47:19,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 365 events. 119/365 cut-off events. For 454/454 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1558 event pairs, 42 based on Foata normal form. 5/342 useless extension candidates. Maximal degree in co-relation 1048. Up to 152 conditions per place. [2025-03-17 19:47:19,240 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 84 selfloop transitions, 2 changer transitions 3/104 dead transitions. [2025-03-17 19:47:19,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 104 transitions, 895 flow [2025-03-17 19:47:19,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:47:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:47:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-17 19:47:19,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5933333333333334 [2025-03-17 19:47:19,241 INFO L175 Difference]: Start difference. First operand has 88 places, 96 transitions, 692 flow. Second operand 3 states and 89 transitions. [2025-03-17 19:47:19,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 104 transitions, 895 flow [2025-03-17 19:47:19,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 104 transitions, 739 flow, removed 47 selfloop flow, removed 9 redundant places. [2025-03-17 19:47:19,247 INFO L231 Difference]: Finished difference. Result has 82 places, 97 transitions, 550 flow [2025-03-17 19:47:19,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=82, PETRI_TRANSITIONS=97} [2025-03-17 19:47:19,248 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2025-03-17 19:47:19,248 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 97 transitions, 550 flow [2025-03-17 19:47:19,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-17 19:47:19,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:19,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:19,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 19:47:19,249 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:19,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:19,250 INFO L85 PathProgramCache]: Analyzing trace with hash 120428565, now seen corresponding path program 1 times [2025-03-17 19:47:19,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:19,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896122150] [2025-03-17 19:47:19,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:19,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:19,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:47:19,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:47:19,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:19,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:19,649 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-17 19:47:19,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:19,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896122150] [2025-03-17 19:47:19,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896122150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:19,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306144523] [2025-03-17 19:47:19,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:19,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:19,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:19,652 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-17 19:47:19,654 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-17 19:47:19,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:47:19,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:47:19,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:19,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:19,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 19:47:19,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:19,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 19:47:20,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 19:47:20,085 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-17 19:47:20,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:20,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-17 19:47:20,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2025-03-17 19:47:20,424 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-17 19:47:20,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306144523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:20,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:20,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-03-17 19:47:20,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173311908] [2025-03-17 19:47:20,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:20,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 19:47:20,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:20,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 19:47:20,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2025-03-17 19:47:20,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-17 19:47:20,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 97 transitions, 550 flow. Second operand has 25 states, 25 states have (on average 13.8) internal successors, (345), 25 states have internal predecessors, (345), 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-17 19:47:20,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:20,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-17 19:47:20,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:24,085 INFO L124 PetriNetUnfolderBase]: 918/2090 cut-off events. [2025-03-17 19:47:24,086 INFO L125 PetriNetUnfolderBase]: For 1019/1019 co-relation queries the response was YES. [2025-03-17 19:47:24,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4805 conditions, 2090 events. 918/2090 cut-off events. For 1019/1019 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 13430 event pairs, 78 based on Foata normal form. 0/1930 useless extension candidates. Maximal degree in co-relation 4778. Up to 284 conditions per place. [2025-03-17 19:47:24,096 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 216 selfloop transitions, 146 changer transitions 11/383 dead transitions. [2025-03-17 19:47:24,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 383 transitions, 2169 flow [2025-03-17 19:47:24,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-17 19:47:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2025-03-17 19:47:24,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 964 transitions. [2025-03-17 19:47:24,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3707692307692308 [2025-03-17 19:47:24,102 INFO L175 Difference]: Start difference. First operand has 82 places, 97 transitions, 550 flow. Second operand 52 states and 964 transitions. [2025-03-17 19:47:24,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 383 transitions, 2169 flow [2025-03-17 19:47:24,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 383 transitions, 2079 flow, removed 43 selfloop flow, removed 2 redundant places. [2025-03-17 19:47:24,110 INFO L231 Difference]: Finished difference. Result has 155 places, 201 transitions, 1410 flow [2025-03-17 19:47:24,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=1410, PETRI_PLACES=155, PETRI_TRANSITIONS=201} [2025-03-17 19:47:24,112 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 106 predicate places. [2025-03-17 19:47:24,112 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 201 transitions, 1410 flow [2025-03-17 19:47:24,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 13.8) internal successors, (345), 25 states have internal predecessors, (345), 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-17 19:47:24,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:24,112 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:24,118 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-17 19:47:24,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:24,315 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:24,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:24,315 INFO L85 PathProgramCache]: Analyzing trace with hash 120414663, now seen corresponding path program 1 times [2025-03-17 19:47:24,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:24,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676428091] [2025-03-17 19:47:24,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:24,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:24,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:47:24,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:47:24,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:24,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:24,745 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-17 19:47:24,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:24,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676428091] [2025-03-17 19:47:24,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676428091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:24,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957109162] [2025-03-17 19:47:24,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:24,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:24,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:24,747 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-17 19:47:24,748 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-17 19:47:24,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:47:24,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:47:24,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:24,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:24,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:47:24,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:24,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-03-17 19:47:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:47:24,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:47:24,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957109162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:24,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:47:24,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 12 [2025-03-17 19:47:24,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285555911] [2025-03-17 19:47:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:24,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:47:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:24,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:47:24,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-17 19:47:24,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2025-03-17 19:47:24,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 201 transitions, 1410 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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-17 19:47:24,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:24,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2025-03-17 19:47:24,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:25,234 INFO L124 PetriNetUnfolderBase]: 1319/2852 cut-off events. [2025-03-17 19:47:25,234 INFO L125 PetriNetUnfolderBase]: For 12184/12252 co-relation queries the response was YES. [2025-03-17 19:47:25,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9636 conditions, 2852 events. 1319/2852 cut-off events. For 12184/12252 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 19676 event pairs, 253 based on Foata normal form. 76/2859 useless extension candidates. Maximal degree in co-relation 9585. Up to 1115 conditions per place. [2025-03-17 19:47:25,252 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 229 selfloop transitions, 46 changer transitions 5/313 dead transitions. [2025-03-17 19:47:25,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 313 transitions, 2624 flow [2025-03-17 19:47:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:47:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 19:47:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2025-03-17 19:47:25,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-03-17 19:47:25,253 INFO L175 Difference]: Start difference. First operand has 155 places, 201 transitions, 1410 flow. Second operand 7 states and 180 transitions. [2025-03-17 19:47:25,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 313 transitions, 2624 flow [2025-03-17 19:47:25,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 313 transitions, 2434 flow, removed 88 selfloop flow, removed 2 redundant places. [2025-03-17 19:47:25,284 INFO L231 Difference]: Finished difference. Result has 162 places, 231 transitions, 1680 flow [2025-03-17 19:47:25,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1680, PETRI_PLACES=162, PETRI_TRANSITIONS=231} [2025-03-17 19:47:25,285 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 113 predicate places. [2025-03-17 19:47:25,285 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 231 transitions, 1680 flow [2025-03-17 19:47:25,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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-17 19:47:25,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:25,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:25,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 19:47:25,486 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,SelfDestructingSolverStorable12 [2025-03-17 19:47:25,486 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:25,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:25,487 INFO L85 PathProgramCache]: Analyzing trace with hash -9821546, now seen corresponding path program 1 times [2025-03-17 19:47:25,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:25,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739730150] [2025-03-17 19:47:25,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:25,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:25,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 19:47:25,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 19:47:25,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:25,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:25,792 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-17 19:47:25,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:25,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739730150] [2025-03-17 19:47:25,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739730150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:25,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31059018] [2025-03-17 19:47:25,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:25,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:25,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:25,794 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-17 19:47:25,796 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-17 19:47:25,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 19:47:25,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 19:47:25,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:25,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:25,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:47:25,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:25,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-03-17 19:47:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:47:25,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:47:25,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31059018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:25,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:47:25,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 11 [2025-03-17 19:47:25,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456861875] [2025-03-17 19:47:25,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:25,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:47:25,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:25,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:47:25,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:47:25,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2025-03-17 19:47:25,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 231 transitions, 1680 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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-17 19:47:25,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:25,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2025-03-17 19:47:25,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:26,276 INFO L124 PetriNetUnfolderBase]: 1291/2812 cut-off events. [2025-03-17 19:47:26,276 INFO L125 PetriNetUnfolderBase]: For 13618/13700 co-relation queries the response was YES. [2025-03-17 19:47:26,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10074 conditions, 2812 events. 1291/2812 cut-off events. For 13618/13700 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19326 event pairs, 213 based on Foata normal form. 86/2831 useless extension candidates. Maximal degree in co-relation 10019. Up to 1541 conditions per place. [2025-03-17 19:47:26,293 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 232 selfloop transitions, 23 changer transitions 5/293 dead transitions. [2025-03-17 19:47:26,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 293 transitions, 2499 flow [2025-03-17 19:47:26,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:47:26,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 19:47:26,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2025-03-17 19:47:26,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-17 19:47:26,295 INFO L175 Difference]: Start difference. First operand has 162 places, 231 transitions, 1680 flow. Second operand 7 states and 175 transitions. [2025-03-17 19:47:26,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 293 transitions, 2499 flow [2025-03-17 19:47:26,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 293 transitions, 2472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:47:26,321 INFO L231 Difference]: Finished difference. Result has 166 places, 230 transitions, 1695 flow [2025-03-17 19:47:26,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1695, PETRI_PLACES=166, PETRI_TRANSITIONS=230} [2025-03-17 19:47:26,322 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 117 predicate places. [2025-03-17 19:47:26,322 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 230 transitions, 1695 flow [2025-03-17 19:47:26,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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-17 19:47:26,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:26,322 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:26,327 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-17 19:47:26,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 19:47:26,526 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:26,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:26,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1418065626, now seen corresponding path program 1 times [2025-03-17 19:47:26,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:26,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070817513] [2025-03-17 19:47:26,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:26,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:26,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 19:47:26,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:47:26,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:26,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:27,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:27,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:27,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070817513] [2025-03-17 19:47:27,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070817513] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:27,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428565759] [2025-03-17 19:47:27,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:27,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:27,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:27,369 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-17 19:47:27,371 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-17 19:47:27,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 19:47:27,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:47:27,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:27,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:27,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 19:47:27,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:27,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-03-17 19:47:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:47:27,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:27,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:27,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2025-03-17 19:47:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:47:27,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428565759] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:27,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 19:47:27,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12, 6] total 22 [2025-03-17 19:47:27,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041844128] [2025-03-17 19:47:27,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:27,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:47:27,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:27,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:47:27,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2025-03-17 19:47:27,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2025-03-17 19:47:27,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 230 transitions, 1695 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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-17 19:47:27,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:27,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2025-03-17 19:47:27,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:28,045 INFO L124 PetriNetUnfolderBase]: 1375/2997 cut-off events. [2025-03-17 19:47:28,045 INFO L125 PetriNetUnfolderBase]: For 19688/19812 co-relation queries the response was YES. [2025-03-17 19:47:28,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11702 conditions, 2997 events. 1375/2997 cut-off events. For 19688/19812 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 20494 event pairs, 152 based on Foata normal form. 66/3001 useless extension candidates. Maximal degree in co-relation 11647. Up to 1455 conditions per place. [2025-03-17 19:47:28,068 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 252 selfloop transitions, 32 changer transitions 4/303 dead transitions. [2025-03-17 19:47:28,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 303 transitions, 2847 flow [2025-03-17 19:47:28,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:47:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 19:47:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2025-03-17 19:47:28,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5171428571428571 [2025-03-17 19:47:28,069 INFO L175 Difference]: Start difference. First operand has 166 places, 230 transitions, 1695 flow. Second operand 7 states and 181 transitions. [2025-03-17 19:47:28,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 303 transitions, 2847 flow [2025-03-17 19:47:28,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 303 transitions, 2815 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:47:28,107 INFO L231 Difference]: Finished difference. Result has 170 places, 240 transitions, 1892 flow [2025-03-17 19:47:28,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1892, PETRI_PLACES=170, PETRI_TRANSITIONS=240} [2025-03-17 19:47:28,107 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 121 predicate places. [2025-03-17 19:47:28,108 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 240 transitions, 1892 flow [2025-03-17 19:47:28,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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-17 19:47:28,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:28,108 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:28,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 19:47:28,312 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,SelfDestructingSolverStorable14 [2025-03-17 19:47:28,312 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:28,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:28,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1814800141, now seen corresponding path program 2 times [2025-03-17 19:47:28,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:28,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619035091] [2025-03-17 19:47:28,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:47:28,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:28,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 19:47:28,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 27 statements. [2025-03-17 19:47:28,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:47:28,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 19:47:28,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:28,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619035091] [2025-03-17 19:47:28,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619035091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:28,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:28,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:47:28,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010722157] [2025-03-17 19:47:28,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:28,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:47:28,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:28,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:47:28,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:47:28,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2025-03-17 19:47:28,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 240 transitions, 1892 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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-17 19:47:28,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:28,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2025-03-17 19:47:28,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:28,766 INFO L124 PetriNetUnfolderBase]: 1343/2954 cut-off events. [2025-03-17 19:47:28,767 INFO L125 PetriNetUnfolderBase]: For 20591/20701 co-relation queries the response was YES. [2025-03-17 19:47:28,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11834 conditions, 2954 events. 1343/2954 cut-off events. For 20591/20701 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 20233 event pairs, 154 based on Foata normal form. 86/2978 useless extension candidates. Maximal degree in co-relation 11775. Up to 1504 conditions per place. [2025-03-17 19:47:28,783 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 243 selfloop transitions, 31 changer transitions 4/293 dead transitions. [2025-03-17 19:47:28,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 293 transitions, 2825 flow [2025-03-17 19:47:28,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:47:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:47:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2025-03-17 19:47:28,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5233333333333333 [2025-03-17 19:47:28,784 INFO L175 Difference]: Start difference. First operand has 170 places, 240 transitions, 1892 flow. Second operand 6 states and 157 transitions. [2025-03-17 19:47:28,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 293 transitions, 2825 flow [2025-03-17 19:47:28,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 293 transitions, 2809 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:47:28,826 INFO L231 Difference]: Finished difference. Result has 173 places, 239 transitions, 1906 flow [2025-03-17 19:47:28,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1906, PETRI_PLACES=173, PETRI_TRANSITIONS=239} [2025-03-17 19:47:28,827 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 124 predicate places. [2025-03-17 19:47:28,827 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 239 transitions, 1906 flow [2025-03-17 19:47:28,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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-17 19:47:28,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:28,827 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:28,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 19:47:28,827 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:28,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:28,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1176466207, now seen corresponding path program 1 times [2025-03-17 19:47:28,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:28,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732590842] [2025-03-17 19:47:28,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:28,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:28,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 19:47:28,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 19:47:28,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:28,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:47:28,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:28,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732590842] [2025-03-17 19:47:28,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732590842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:28,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915355756] [2025-03-17 19:47:28,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:28,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:28,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:28,921 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-17 19:47:28,922 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-17 19:47:28,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 19:47:28,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 19:47:28,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:28,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:28,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:47:28,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:47:29,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:47:29,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915355756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:29,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:29,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-17 19:47:29,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964968401] [2025-03-17 19:47:29,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:29,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 19:47:29,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:29,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 19:47:29,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:47:29,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-03-17 19:47:29,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 239 transitions, 1906 flow. Second operand has 15 states, 15 states have (on average 18.133333333333333) internal successors, (272), 15 states have internal predecessors, (272), 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-17 19:47:29,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:29,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-03-17 19:47:29,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:29,374 INFO L124 PetriNetUnfolderBase]: 531/1373 cut-off events. [2025-03-17 19:47:29,374 INFO L125 PetriNetUnfolderBase]: For 9677/9728 co-relation queries the response was YES. [2025-03-17 19:47:29,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5816 conditions, 1373 events. 531/1373 cut-off events. For 9677/9728 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 8554 event pairs, 282 based on Foata normal form. 61/1400 useless extension candidates. Maximal degree in co-relation 5757. Up to 651 conditions per place. [2025-03-17 19:47:29,381 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 95 selfloop transitions, 57 changer transitions 4/186 dead transitions. [2025-03-17 19:47:29,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 186 transitions, 1759 flow [2025-03-17 19:47:29,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:47:29,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 19:47:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2025-03-17 19:47:29,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-03-17 19:47:29,382 INFO L175 Difference]: Start difference. First operand has 173 places, 239 transitions, 1906 flow. Second operand 8 states and 175 transitions. [2025-03-17 19:47:29,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 186 transitions, 1759 flow [2025-03-17 19:47:29,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 186 transitions, 1687 flow, removed 12 selfloop flow, removed 12 redundant places. [2025-03-17 19:47:29,400 INFO L231 Difference]: Finished difference. Result has 157 places, 169 transitions, 1423 flow [2025-03-17 19:47:29,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1423, PETRI_PLACES=157, PETRI_TRANSITIONS=169} [2025-03-17 19:47:29,400 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 108 predicate places. [2025-03-17 19:47:29,401 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 169 transitions, 1423 flow [2025-03-17 19:47:29,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 18.133333333333333) internal successors, (272), 15 states have internal predecessors, (272), 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-17 19:47:29,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:29,401 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:29,406 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-17 19:47:29,605 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,SelfDestructingSolverStorable16 [2025-03-17 19:47:29,605 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:29,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1591174244, now seen corresponding path program 1 times [2025-03-17 19:47:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:29,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118933484] [2025-03-17 19:47:29,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:29,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:29,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 19:47:29,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:47:29,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:29,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:47:29,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:29,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118933484] [2025-03-17 19:47:29,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118933484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:29,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286554222] [2025-03-17 19:47:29,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:29,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:29,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:29,687 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-17 19:47:29,689 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-17 19:47:29,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 19:47:29,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:47:29,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:29,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:29,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:47:29,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:29,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:47:29,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:47:29,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286554222] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:29,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:29,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-17 19:47:29,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346469738] [2025-03-17 19:47:29,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:29,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 19:47:29,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:29,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 19:47:29,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:47:29,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-03-17 19:47:29,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 169 transitions, 1423 flow. Second operand has 15 states, 15 states have (on average 18.266666666666666) internal successors, (274), 15 states have internal predecessors, (274), 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-17 19:47:29,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:29,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-03-17 19:47:29,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:30,331 INFO L124 PetriNetUnfolderBase]: 886/2310 cut-off events. [2025-03-17 19:47:30,331 INFO L125 PetriNetUnfolderBase]: For 11254/11316 co-relation queries the response was YES. [2025-03-17 19:47:30,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8866 conditions, 2310 events. 886/2310 cut-off events. For 11254/11316 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 16543 event pairs, 457 based on Foata normal form. 72/2331 useless extension candidates. Maximal degree in co-relation 8815. Up to 900 conditions per place. [2025-03-17 19:47:30,346 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 149 selfloop transitions, 89 changer transitions 38/306 dead transitions. [2025-03-17 19:47:30,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 306 transitions, 3110 flow [2025-03-17 19:47:30,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 19:47:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 19:47:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 292 transitions. [2025-03-17 19:47:30,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41714285714285715 [2025-03-17 19:47:30,347 INFO L175 Difference]: Start difference. First operand has 157 places, 169 transitions, 1423 flow. Second operand 14 states and 292 transitions. [2025-03-17 19:47:30,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 306 transitions, 3110 flow [2025-03-17 19:47:30,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 306 transitions, 2984 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 19:47:30,374 INFO L231 Difference]: Finished difference. Result has 168 places, 213 transitions, 1986 flow [2025-03-17 19:47:30,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1986, PETRI_PLACES=168, PETRI_TRANSITIONS=213} [2025-03-17 19:47:30,374 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 119 predicate places. [2025-03-17 19:47:30,374 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 213 transitions, 1986 flow [2025-03-17 19:47:30,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 18.266666666666666) internal successors, (274), 15 states have internal predecessors, (274), 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-17 19:47:30,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:30,374 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:30,380 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-17 19:47:30,575 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,SelfDestructingSolverStorable17 [2025-03-17 19:47:30,575 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:30,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:30,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1748291053, now seen corresponding path program 2 times [2025-03-17 19:47:30,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:30,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384831456] [2025-03-17 19:47:30,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:47:30,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:30,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-17 19:47:30,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 19:47:30,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:47:30,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:30,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:47:30,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:30,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384831456] [2025-03-17 19:47:30,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384831456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:30,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:30,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:47:30,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012704592] [2025-03-17 19:47:30,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:30,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:47:30,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:30,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:47:30,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:47:30,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-17 19:47:30,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 213 transitions, 1986 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-17 19:47:30,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:30,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-17 19:47:30,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:30,903 INFO L124 PetriNetUnfolderBase]: 1005/2614 cut-off events. [2025-03-17 19:47:30,903 INFO L125 PetriNetUnfolderBase]: For 14087/14232 co-relation queries the response was YES. [2025-03-17 19:47:30,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10180 conditions, 2614 events. 1005/2614 cut-off events. For 14087/14232 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 18446 event pairs, 354 based on Foata normal form. 116/2623 useless extension candidates. Maximal degree in co-relation 10125. Up to 1033 conditions per place. [2025-03-17 19:47:30,916 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 192 selfloop transitions, 23 changer transitions 1/247 dead transitions. [2025-03-17 19:47:30,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 247 transitions, 2694 flow [2025-03-17 19:47:30,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:47:30,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:47:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-03-17 19:47:30,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-17 19:47:30,917 INFO L175 Difference]: Start difference. First operand has 168 places, 213 transitions, 1986 flow. Second operand 4 states and 120 transitions. [2025-03-17 19:47:30,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 247 transitions, 2694 flow [2025-03-17 19:47:30,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 247 transitions, 2658 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-17 19:47:30,942 INFO L231 Difference]: Finished difference. Result has 168 places, 218 transitions, 2128 flow [2025-03-17 19:47:30,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1898, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2128, PETRI_PLACES=168, PETRI_TRANSITIONS=218} [2025-03-17 19:47:30,943 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 119 predicate places. [2025-03-17 19:47:30,943 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 218 transitions, 2128 flow [2025-03-17 19:47:30,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-17 19:47:30,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:30,944 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:30,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 19:47:30,944 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:30,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:30,944 INFO L85 PathProgramCache]: Analyzing trace with hash -811204664, now seen corresponding path program 2 times [2025-03-17 19:47:30,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:30,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278153637] [2025-03-17 19:47:30,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:47:30,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:30,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-17 19:47:30,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:47:30,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:47:30,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:47:31,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:31,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278153637] [2025-03-17 19:47:31,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278153637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:31,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:31,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:47:31,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339819649] [2025-03-17 19:47:31,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:31,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:47:31,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:31,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:47:31,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:47:31,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-03-17 19:47:31,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 218 transitions, 2128 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:47:31,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:31,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-03-17 19:47:31,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:31,207 INFO L124 PetriNetUnfolderBase]: 786/2021 cut-off events. [2025-03-17 19:47:31,207 INFO L125 PetriNetUnfolderBase]: For 12213/12291 co-relation queries the response was YES. [2025-03-17 19:47:31,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8455 conditions, 2021 events. 786/2021 cut-off events. For 12213/12291 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 13133 event pairs, 290 based on Foata normal form. 81/2016 useless extension candidates. Maximal degree in co-relation 8399. Up to 833 conditions per place. [2025-03-17 19:47:31,219 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 202 selfloop transitions, 10 changer transitions 18/252 dead transitions. [2025-03-17 19:47:31,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 252 transitions, 2933 flow [2025-03-17 19:47:31,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:47:31,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:47:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2025-03-17 19:47:31,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61 [2025-03-17 19:47:31,220 INFO L175 Difference]: Start difference. First operand has 168 places, 218 transitions, 2128 flow. Second operand 4 states and 122 transitions. [2025-03-17 19:47:31,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 252 transitions, 2933 flow [2025-03-17 19:47:31,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 252 transitions, 2834 flow, removed 38 selfloop flow, removed 9 redundant places. [2025-03-17 19:47:31,238 INFO L231 Difference]: Finished difference. Result has 159 places, 186 transitions, 1855 flow [2025-03-17 19:47:31,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1929, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1855, PETRI_PLACES=159, PETRI_TRANSITIONS=186} [2025-03-17 19:47:31,239 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 110 predicate places. [2025-03-17 19:47:31,239 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 186 transitions, 1855 flow [2025-03-17 19:47:31,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:47:31,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:31,239 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1] [2025-03-17 19:47:31,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 19:47:31,239 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:31,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:31,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2145888017, now seen corresponding path program 2 times [2025-03-17 19:47:31,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:31,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003465302] [2025-03-17 19:47:31,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:47:31,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:31,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-17 19:47:31,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-03-17 19:47:31,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:47:31,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 19:47:31,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:31,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003465302] [2025-03-17 19:47:31,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003465302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:31,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025718030] [2025-03-17 19:47:31,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:47:31,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:31,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:31,272 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-17 19:47:31,274 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-17 19:47:31,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-17 19:47:31,338 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-03-17 19:47:31,338 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:47:31,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:31,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:47:31,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 19:47:31,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 19:47:31,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025718030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:31,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:31,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-17 19:47:31,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977096022] [2025-03-17 19:47:31,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:31,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:47:31,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:31,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:47:31,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:47:31,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-03-17 19:47:31,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 186 transitions, 1855 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-17 19:47:31,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:31,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-03-17 19:47:31,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:31,578 INFO L124 PetriNetUnfolderBase]: 668/1808 cut-off events. [2025-03-17 19:47:31,579 INFO L125 PetriNetUnfolderBase]: For 9019/9057 co-relation queries the response was YES. [2025-03-17 19:47:31,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7161 conditions, 1808 events. 668/1808 cut-off events. For 9019/9057 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 11853 event pairs, 429 based on Foata normal form. 9/1749 useless extension candidates. Maximal degree in co-relation 7110. Up to 1145 conditions per place. [2025-03-17 19:47:31,587 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 64 selfloop transitions, 54 changer transitions 46/185 dead transitions. [2025-03-17 19:47:31,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 185 transitions, 2161 flow [2025-03-17 19:47:31,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:47:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:47:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-03-17 19:47:31,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.404 [2025-03-17 19:47:31,587 INFO L175 Difference]: Start difference. First operand has 159 places, 186 transitions, 1855 flow. Second operand 5 states and 101 transitions. [2025-03-17 19:47:31,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 185 transitions, 2161 flow [2025-03-17 19:47:31,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 185 transitions, 2011 flow, removed 34 selfloop flow, removed 17 redundant places. [2025-03-17 19:47:31,598 INFO L231 Difference]: Finished difference. Result has 132 places, 139 transitions, 1294 flow [2025-03-17 19:47:31,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1683, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1294, PETRI_PLACES=132, PETRI_TRANSITIONS=139} [2025-03-17 19:47:31,599 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 83 predicate places. [2025-03-17 19:47:31,599 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 139 transitions, 1294 flow [2025-03-17 19:47:31,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-17 19:47:31,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:31,599 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:31,605 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-17 19:47:31,803 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,SelfDestructingSolverStorable20 [2025-03-17 19:47:31,803 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:31,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:31,803 INFO L85 PathProgramCache]: Analyzing trace with hash -8450003, now seen corresponding path program 1 times [2025-03-17 19:47:31,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:31,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861728803] [2025-03-17 19:47:31,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:31,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:31,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 19:47:31,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 19:47:31,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:31,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:32,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:32,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861728803] [2025-03-17 19:47:32,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861728803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:32,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192370220] [2025-03-17 19:47:32,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:32,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:32,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:32,309 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-17 19:47:32,310 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-17 19:47:32,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 19:47:32,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 19:47:32,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:32,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:32,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 19:47:32,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:32,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 19:47:32,839 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 19:47:32,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-17 19:47:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 19:47:32,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:33,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-03-17 19:47:33,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2025-03-17 19:47:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 19:47:33,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192370220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:33,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:33,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 39 [2025-03-17 19:47:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153914877] [2025-03-17 19:47:33,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:33,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-17 19:47:33,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:33,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 19:47:33,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1400, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 19:47:33,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-17 19:47:33,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 139 transitions, 1294 flow. Second operand has 40 states, 40 states have (on average 10.025) internal successors, (401), 40 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-17 19:47:33,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:33,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-17 19:47:33,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:36,112 INFO L124 PetriNetUnfolderBase]: 3403/6354 cut-off events. [2025-03-17 19:47:36,112 INFO L125 PetriNetUnfolderBase]: For 13311/13311 co-relation queries the response was YES. [2025-03-17 19:47:36,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21780 conditions, 6354 events. 3403/6354 cut-off events. For 13311/13311 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 41662 event pairs, 299 based on Foata normal form. 302/6342 useless extension candidates. Maximal degree in co-relation 21744. Up to 1206 conditions per place. [2025-03-17 19:47:36,140 INFO L140 encePairwiseOnDemand]: 32/50 looper letters, 283 selfloop transitions, 163 changer transitions 33/485 dead transitions. [2025-03-17 19:47:36,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 485 transitions, 4281 flow [2025-03-17 19:47:36,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-17 19:47:36,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-03-17 19:47:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 718 transitions. [2025-03-17 19:47:36,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30553191489361703 [2025-03-17 19:47:36,142 INFO L175 Difference]: Start difference. First operand has 132 places, 139 transitions, 1294 flow. Second operand 47 states and 718 transitions. [2025-03-17 19:47:36,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 485 transitions, 4281 flow [2025-03-17 19:47:36,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 485 transitions, 4152 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-03-17 19:47:36,157 INFO L231 Difference]: Finished difference. Result has 185 places, 221 transitions, 2503 flow [2025-03-17 19:47:36,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=2503, PETRI_PLACES=185, PETRI_TRANSITIONS=221} [2025-03-17 19:47:36,157 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 136 predicate places. [2025-03-17 19:47:36,157 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 221 transitions, 2503 flow [2025-03-17 19:47:36,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 10.025) internal successors, (401), 40 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-17 19:47:36,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:36,158 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:36,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 19:47:36,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:36,359 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 19:47:36,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:36,359 INFO L85 PathProgramCache]: Analyzing trace with hash 653647153, now seen corresponding path program 1 times [2025-03-17 19:47:36,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:36,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453201925] [2025-03-17 19:47:36,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:36,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:36,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 19:47:36,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 19:47:36,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:36,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:47:36,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:36,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453201925] [2025-03-17 19:47:36,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453201925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:36,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091095482] [2025-03-17 19:47:36,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:36,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:36,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:36,849 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-17 19:47:36,850 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-17 19:47:36,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 19:47:36,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 19:47:36,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:36,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:36,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-17 19:47:36,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:36,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:47:37,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 19:47:37,080 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:47:37,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:47:37,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 19:47:37,239 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-03-17 19:47:37,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 21 [2025-03-17 19:47:38,409 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 19:47:38,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 17 [2025-03-17 19:47:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:38,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:48,347 INFO L349 Elim1Store]: treesize reduction 45, result has 52.6 percent of original size [2025-03-17 19:47:48,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2565 treesize of output 2180 [2025-03-17 19:47:48,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:48,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 868 treesize of output 830 [2025-03-17 19:47:48,685 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-03-17 19:47:48,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 100 [2025-03-17 19:47:48,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:47:48,799 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 19:47:48,825 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-03-17 19:47:48,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 187 [2025-03-17 19:47:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:49,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091095482] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:49,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:49,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 21] total 54 [2025-03-17 19:47:49,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171379211] [2025-03-17 19:47:49,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:49,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-17 19:47:49,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:49,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-17 19:47:49,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=2734, Unknown=1, NotChecked=0, Total=3080 [2025-03-17 19:47:53,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 19:47:58,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 19:48:02,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 19:48:06,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 19:48:06,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 50 [2025-03-17 19:48:06,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 221 transitions, 2503 flow. Second operand has 56 states, 56 states have (on average 5.982142857142857) internal successors, (335), 56 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-17 19:48:06,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:48:06,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 50 [2025-03-17 19:48:06,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:48:11,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 19:48:15,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 19:48:43,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 19:48:47,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]