./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.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 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:29:34,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:29:34,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:29:34,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:29:34,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:29:34,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:29:34,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:29:34,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:29:34,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:29:34,802 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:29:34,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:29:34,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:29:34,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:29:34,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:29:34,803 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:29:34,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:29:34,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:29:34,803 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:29:34,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:29:34,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:29:34,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:29:34,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:29:34,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:29:34,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:29:34,804 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:29:34,804 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:29:34,804 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:29:34,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:29:34,804 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:29:34,804 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:29:34,804 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:29:34,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:29:34,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:29:34,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:29:34,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:29:34,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:29:34,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:29:34,805 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:29:34,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:29:34,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:29:34,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:29:34,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:29:34,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:29:34,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:29:34,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:29:34,805 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 -> 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac [2025-03-04 15:29:35,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:29:35,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:29:35,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:29:35,015 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:29:35,015 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:29:35,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-03-04 15:29:36,150 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e72b29ea4/802bcd16f80c4f2598580710bdcb5587/FLAG33084bba4 [2025-03-04 15:29:36,414 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:29:36,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-03-04 15:29:36,423 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e72b29ea4/802bcd16f80c4f2598580710bdcb5587/FLAG33084bba4 [2025-03-04 15:29:36,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e72b29ea4/802bcd16f80c4f2598580710bdcb5587 [2025-03-04 15:29:36,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:29:36,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:29:36,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:36,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:29:36,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:29:36,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:36" (1/1) ... [2025-03-04 15:29:36,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f5bab72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:36, skipping insertion in model container [2025-03-04 15:29:36,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:36" (1/1) ... [2025-03-04 15:29:36,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:29:36,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:36,909 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:29:36,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:36,950 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:29:36,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:36 WrapperNode [2025-03-04 15:29:36,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:36,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:36,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:29:36,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:29:36,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:36" (1/1) ... [2025-03-04 15:29:36,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:36" (1/1) ... [2025-03-04 15:29:36,996 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 259 [2025-03-04 15:29:36,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:36,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:29:36,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:29:36,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:29:37,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:36" (1/1) ... [2025-03-04 15:29:37,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:36" (1/1) ... [2025-03-04 15:29:37,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:36" (1/1) ... [2025-03-04 15:29:37,020 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 15:29:37,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:36" (1/1) ... [2025-03-04 15:29:37,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:36" (1/1) ... [2025-03-04 15:29:37,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:36" (1/1) ... [2025-03-04 15:29:37,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:36" (1/1) ... [2025-03-04 15:29:37,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:36" (1/1) ... [2025-03-04 15:29:37,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:36" (1/1) ... [2025-03-04 15:29:37,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:29:37,032 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:29:37,033 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:29:37,033 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:29:37,033 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:36" (1/1) ... [2025-03-04 15:29:37,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:29:37,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:37,061 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:29:37,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:29:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:29:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:29:37,079 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:29:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:29:37,079 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:29:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:29:37,080 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:29:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:29:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:29:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:29:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:29:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:29:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:29:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:29:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:29:37,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:29:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:29:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:29:37,081 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:29:37,170 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:29:37,171 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:29:37,524 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:29:37,524 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:29:37,788 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:29:37,789 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:29:37,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:37 BoogieIcfgContainer [2025-03-04 15:29:37,790 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:29:37,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:29:37,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:29:37,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:29:37,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:29:36" (1/3) ... [2025-03-04 15:29:37,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e79c7a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:37, skipping insertion in model container [2025-03-04 15:29:37,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:36" (2/3) ... [2025-03-04 15:29:37,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e79c7a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:37, skipping insertion in model container [2025-03-04 15:29:37,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:37" (3/3) ... [2025-03-04 15:29:37,800 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2025-03-04 15:29:37,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:29:37,816 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-3-nl.wvr.c that has 4 procedures, 62 locations, 1 initial locations, 5 loop locations, and 20 error locations. [2025-03-04 15:29:37,817 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:29:37,868 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:29:37,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 68 transitions, 157 flow [2025-03-04 15:29:37,915 INFO L124 PetriNetUnfolderBase]: 7/65 cut-off events. [2025-03-04 15:29:37,917 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:29:37,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 65 events. 7/65 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 214 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2025-03-04 15:29:37,922 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 68 transitions, 157 flow [2025-03-04 15:29:37,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 63 transitions, 141 flow [2025-03-04 15:29:37,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:29:37,944 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;@4db1c864, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:29:37,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-03-04 15:29:37,947 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:29:37,947 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:29:37,947 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:29:37,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:37,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:29:37,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:29:37,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash 707964, now seen corresponding path program 1 times [2025-03-04 15:29:37,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:37,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361449396] [2025-03-04 15:29:37,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:37,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:38,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:29:38,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:29:38,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:38,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:38,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:38,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361449396] [2025-03-04 15:29:38,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361449396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:38,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:38,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:38,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484589196] [2025-03-04 15:29:38,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:38,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:38,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:38,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:38,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:38,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 68 [2025-03-04 15:29:38,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:38,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:38,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 68 [2025-03-04 15:29:38,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:38,836 INFO L124 PetriNetUnfolderBase]: 2486/4394 cut-off events. [2025-03-04 15:29:38,837 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2025-03-04 15:29:38,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7998 conditions, 4394 events. 2486/4394 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 29063 event pairs, 2170 based on Foata normal form. 2/3264 useless extension candidates. Maximal degree in co-relation 7615. Up to 3377 conditions per place. [2025-03-04 15:29:38,878 INFO L140 encePairwiseOnDemand]: 50/68 looper letters, 39 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2025-03-04 15:29:38,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 62 transitions, 231 flow [2025-03-04 15:29:38,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2025-03-04 15:29:38,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4889705882352941 [2025-03-04 15:29:38,892 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 141 flow. Second operand 4 states and 133 transitions. [2025-03-04 15:29:38,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 62 transitions, 231 flow [2025-03-04 15:29:38,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 62 transitions, 222 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:38,899 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 178 flow [2025-03-04 15:29:38,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2025-03-04 15:29:38,903 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -4 predicate places. [2025-03-04 15:29:38,903 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 178 flow [2025-03-04 15:29:38,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:38,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:38,904 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:29:38,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:29:38,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:29:38,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:38,905 INFO L85 PathProgramCache]: Analyzing trace with hash -383270053, now seen corresponding path program 1 times [2025-03-04 15:29:38,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:38,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044481264] [2025-03-04 15:29:38,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:38,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:38,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:29:38,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:29:38,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:38,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:39,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:39,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:39,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044481264] [2025-03-04 15:29:39,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044481264] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:39,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138671850] [2025-03-04 15:29:39,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:39,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:39,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:39,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:39,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:29:39,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:29:39,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:29:39,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:39,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:39,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:39,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:39,133 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:29:39,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138671850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:39,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:29:39,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:29:39,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317764563] [2025-03-04 15:29:39,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:39,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:29:39,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:39,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:29:39,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:29:39,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 68 [2025-03-04 15:29:39,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:39,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:39,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 68 [2025-03-04 15:29:39,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:39,622 INFO L124 PetriNetUnfolderBase]: 2486/4392 cut-off events. [2025-03-04 15:29:39,622 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-03-04 15:29:39,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7952 conditions, 4392 events. 2486/4392 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 29071 event pairs, 2170 based on Foata normal form. 2/3265 useless extension candidates. Maximal degree in co-relation 7902. Up to 3367 conditions per place. [2025-03-04 15:29:39,649 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 32 selfloop transitions, 12 changer transitions 0/60 dead transitions. [2025-03-04 15:29:39,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 258 flow [2025-03-04 15:29:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:29:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:29:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2025-03-04 15:29:39,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2025-03-04 15:29:39,651 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 178 flow. Second operand 6 states and 160 transitions. [2025-03-04 15:29:39,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 258 flow [2025-03-04 15:29:39,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 258 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:29:39,653 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 194 flow [2025-03-04 15:29:39,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=194, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2025-03-04 15:29:39,653 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-03-04 15:29:39,653 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 194 flow [2025-03-04 15:29:39,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:39,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:39,654 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:39,661 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-04 15:29:39,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:39,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:29:39,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:39,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1028693867, now seen corresponding path program 1 times [2025-03-04 15:29:39,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:39,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076642758] [2025-03-04 15:29:39,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:39,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:39,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:39,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:39,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:39,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:39,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:39,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076642758] [2025-03-04 15:29:39,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076642758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:39,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:39,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:39,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708157096] [2025-03-04 15:29:39,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:39,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:39,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:39,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:39,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:39,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 68 [2025-03-04 15:29:39,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:39,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:39,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 68 [2025-03-04 15:29:39,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:40,321 INFO L124 PetriNetUnfolderBase]: 2626/4679 cut-off events. [2025-03-04 15:29:40,322 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-04 15:29:40,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8505 conditions, 4679 events. 2626/4679 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 30833 event pairs, 2297 based on Foata normal form. 101/3617 useless extension candidates. Maximal degree in co-relation 7906. Up to 3375 conditions per place. [2025-03-04 15:29:40,352 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 58 selfloop transitions, 3 changer transitions 1/80 dead transitions. [2025-03-04 15:29:40,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 80 transitions, 392 flow [2025-03-04 15:29:40,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2025-03-04 15:29:40,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5661764705882353 [2025-03-04 15:29:40,354 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 194 flow. Second operand 4 states and 154 transitions. [2025-03-04 15:29:40,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 80 transitions, 392 flow [2025-03-04 15:29:40,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 80 transitions, 350 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:40,357 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 185 flow [2025-03-04 15:29:40,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2025-03-04 15:29:40,358 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-03-04 15:29:40,358 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 185 flow [2025-03-04 15:29:40,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:40,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:40,359 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:29:40,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:29:40,359 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:29:40,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:40,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1003530858, now seen corresponding path program 1 times [2025-03-04 15:29:40,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:40,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386602597] [2025-03-04 15:29:40,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:40,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:40,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:40,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:40,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:40,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:40,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:40,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386602597] [2025-03-04 15:29:40,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386602597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:40,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049739920] [2025-03-04 15:29:40,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:40,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:40,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:40,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:40,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:29:40,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:40,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:40,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:40,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:40,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:40,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:40,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:40,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049739920] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:40,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:40,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:29:40,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832577446] [2025-03-04 15:29:40,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:40,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:29:40,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:40,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:29:40,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:29:40,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 68 [2025-03-04 15:29:40,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 60 transitions, 185 flow. Second operand has 12 states, 12 states have (on average 20.083333333333332) internal successors, (241), 12 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:40,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:40,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 68 [2025-03-04 15:29:40,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:40,980 INFO L124 PetriNetUnfolderBase]: 2583/4527 cut-off events. [2025-03-04 15:29:40,981 INFO L125 PetriNetUnfolderBase]: For 361/361 co-relation queries the response was YES. [2025-03-04 15:29:40,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9114 conditions, 4527 events. 2583/4527 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 29320 event pairs, 2297 based on Foata normal form. 9/3452 useless extension candidates. Maximal degree in co-relation 8527. Up to 3604 conditions per place. [2025-03-04 15:29:40,999 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 37 selfloop transitions, 25 changer transitions 0/78 dead transitions. [2025-03-04 15:29:40,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 78 transitions, 393 flow [2025-03-04 15:29:40,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 258 transitions. [2025-03-04 15:29:41,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37941176470588234 [2025-03-04 15:29:41,001 INFO L175 Difference]: Start difference. First operand has 64 places, 60 transitions, 185 flow. Second operand 10 states and 258 transitions. [2025-03-04 15:29:41,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 78 transitions, 393 flow [2025-03-04 15:29:41,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 78 transitions, 389 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:41,002 INFO L231 Difference]: Finished difference. Result has 75 places, 78 transitions, 349 flow [2025-03-04 15:29:41,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=349, PETRI_PLACES=75, PETRI_TRANSITIONS=78} [2025-03-04 15:29:41,003 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 9 predicate places. [2025-03-04 15:29:41,003 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 349 flow [2025-03-04 15:29:41,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.083333333333332) internal successors, (241), 12 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:41,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:41,004 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:41,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:41,204 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,SelfDestructingSolverStorable3 [2025-03-04 15:29:41,205 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:29:41,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:41,205 INFO L85 PathProgramCache]: Analyzing trace with hash -19244241, now seen corresponding path program 1 times [2025-03-04 15:29:41,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:41,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024237353] [2025-03-04 15:29:41,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:41,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:41,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:29:41,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:29:41,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:41,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:41,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:41,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024237353] [2025-03-04 15:29:41,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024237353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:41,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:41,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:29:41,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170988654] [2025-03-04 15:29:41,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:41,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:41,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:41,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:41,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:29:41,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 68 [2025-03-04 15:29:41,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:41,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:41,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 68 [2025-03-04 15:29:41,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:41,562 INFO L124 PetriNetUnfolderBase]: 2529/4421 cut-off events. [2025-03-04 15:29:41,563 INFO L125 PetriNetUnfolderBase]: For 512/512 co-relation queries the response was YES. [2025-03-04 15:29:41,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9220 conditions, 4421 events. 2529/4421 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 28240 event pairs, 917 based on Foata normal form. 107/3454 useless extension candidates. Maximal degree in co-relation 9123. Up to 2654 conditions per place. [2025-03-04 15:29:41,581 INFO L140 encePairwiseOnDemand]: 64/68 looper letters, 76 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2025-03-04 15:29:41,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 96 transitions, 556 flow [2025-03-04 15:29:41,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2025-03-04 15:29:41,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6127450980392157 [2025-03-04 15:29:41,583 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 349 flow. Second operand 3 states and 125 transitions. [2025-03-04 15:29:41,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 96 transitions, 556 flow [2025-03-04 15:29:41,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 524 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 15:29:41,586 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 331 flow [2025-03-04 15:29:41,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2025-03-04 15:29:41,587 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 9 predicate places. [2025-03-04 15:29:41,587 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 331 flow [2025-03-04 15:29:41,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:41,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:41,587 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:41,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:29:41,587 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:29:41,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:41,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1053717046, now seen corresponding path program 1 times [2025-03-04 15:29:41,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:41,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751118397] [2025-03-04 15:29:41,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:41,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:41,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:29:41,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:29:41,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:41,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:41,713 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-04 15:29:41,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:41,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751118397] [2025-03-04 15:29:41,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751118397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:41,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132834253] [2025-03-04 15:29:41,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:41,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:41,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:41,715 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:41,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:29:41,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:29:41,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:29:41,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:41,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:41,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:29:41,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:41,791 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-04 15:29:41,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:29:41,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132834253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:41,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:29:41,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-03-04 15:29:41,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485211375] [2025-03-04 15:29:41,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:41,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:41,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:41,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:41,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:29:41,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 68 [2025-03-04 15:29:41,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:41,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:41,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 68 [2025-03-04 15:29:41,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:42,000 INFO L124 PetriNetUnfolderBase]: 1674/3016 cut-off events. [2025-03-04 15:29:42,000 INFO L125 PetriNetUnfolderBase]: For 501/501 co-relation queries the response was YES. [2025-03-04 15:29:42,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6356 conditions, 3016 events. 1674/3016 cut-off events. For 501/501 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 17932 event pairs, 1390 based on Foata normal form. 0/2682 useless extension candidates. Maximal degree in co-relation 6262. Up to 2394 conditions per place. [2025-03-04 15:29:42,012 INFO L140 encePairwiseOnDemand]: 64/68 looper letters, 57 selfloop transitions, 1 changer transitions 0/76 dead transitions. [2025-03-04 15:29:42,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 76 transitions, 435 flow [2025-03-04 15:29:42,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-04 15:29:42,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2025-03-04 15:29:42,013 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 331 flow. Second operand 3 states and 105 transitions. [2025-03-04 15:29:42,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 76 transitions, 435 flow [2025-03-04 15:29:42,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 76 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:42,017 INFO L231 Difference]: Finished difference. Result has 73 places, 76 transitions, 319 flow [2025-03-04 15:29:42,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=73, PETRI_TRANSITIONS=76} [2025-03-04 15:29:42,019 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 7 predicate places. [2025-03-04 15:29:42,019 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 76 transitions, 319 flow [2025-03-04 15:29:42,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:42,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:42,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:42,025 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-04 15:29:42,219 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-04 15:29:42,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:29:42,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:42,220 INFO L85 PathProgramCache]: Analyzing trace with hash 990224334, now seen corresponding path program 1 times [2025-03-04 15:29:42,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:42,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110906822] [2025-03-04 15:29:42,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:42,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:42,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:29:42,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:29:42,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:42,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:42,275 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-04 15:29:42,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:42,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110906822] [2025-03-04 15:29:42,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110906822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:42,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:42,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:42,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436271803] [2025-03-04 15:29:42,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:42,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:42,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:42,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:42,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:42,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 68 [2025-03-04 15:29:42,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 76 transitions, 319 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:42,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:42,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 68 [2025-03-04 15:29:42,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:42,580 INFO L124 PetriNetUnfolderBase]: 2780/4691 cut-off events. [2025-03-04 15:29:42,581 INFO L125 PetriNetUnfolderBase]: For 809/809 co-relation queries the response was YES. [2025-03-04 15:29:42,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10105 conditions, 4691 events. 2780/4691 cut-off events. For 809/809 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 28035 event pairs, 1522 based on Foata normal form. 96/4391 useless extension candidates. Maximal degree in co-relation 10089. Up to 3069 conditions per place. [2025-03-04 15:29:42,603 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 94 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2025-03-04 15:29:42,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 114 transitions, 619 flow [2025-03-04 15:29:42,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:42,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2025-03-04 15:29:42,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5772058823529411 [2025-03-04 15:29:42,605 INFO L175 Difference]: Start difference. First operand has 73 places, 76 transitions, 319 flow. Second operand 4 states and 157 transitions. [2025-03-04 15:29:42,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 114 transitions, 619 flow [2025-03-04 15:29:42,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 114 transitions, 618 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:42,607 INFO L231 Difference]: Finished difference. Result has 77 places, 79 transitions, 347 flow [2025-03-04 15:29:42,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=347, PETRI_PLACES=77, PETRI_TRANSITIONS=79} [2025-03-04 15:29:42,608 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2025-03-04 15:29:42,608 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 347 flow [2025-03-04 15:29:42,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:42,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:42,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:42,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:29:42,608 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:29:42,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:42,609 INFO L85 PathProgramCache]: Analyzing trace with hash 950046205, now seen corresponding path program 1 times [2025-03-04 15:29:42,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:42,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089065797] [2025-03-04 15:29:42,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:42,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:42,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:29:42,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:29:42,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:42,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:42,666 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-04 15:29:42,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:42,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089065797] [2025-03-04 15:29:42,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089065797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:42,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:42,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:42,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612067200] [2025-03-04 15:29:42,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:42,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:42,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:42,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:42,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:29:42,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 68 [2025-03-04 15:29:42,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:42,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:42,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 68 [2025-03-04 15:29:42,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:42,863 INFO L124 PetriNetUnfolderBase]: 1973/3669 cut-off events. [2025-03-04 15:29:42,864 INFO L125 PetriNetUnfolderBase]: For 1296/1356 co-relation queries the response was YES. [2025-03-04 15:29:42,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8380 conditions, 3669 events. 1973/3669 cut-off events. For 1296/1356 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 23384 event pairs, 896 based on Foata normal form. 18/3327 useless extension candidates. Maximal degree in co-relation 8362. Up to 2593 conditions per place. [2025-03-04 15:29:42,882 INFO L140 encePairwiseOnDemand]: 64/68 looper letters, 67 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2025-03-04 15:29:42,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 88 transitions, 512 flow [2025-03-04 15:29:42,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:42,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:42,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-03-04 15:29:42,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553921568627451 [2025-03-04 15:29:42,883 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 347 flow. Second operand 3 states and 113 transitions. [2025-03-04 15:29:42,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 88 transitions, 512 flow [2025-03-04 15:29:42,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 88 transitions, 509 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:42,885 INFO L231 Difference]: Finished difference. Result has 79 places, 81 transitions, 367 flow [2025-03-04 15:29:42,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=367, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2025-03-04 15:29:42,886 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2025-03-04 15:29:42,886 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 367 flow [2025-03-04 15:29:42,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:42,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:42,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:42,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:29:42,886 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:29:42,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:42,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1129941298, now seen corresponding path program 1 times [2025-03-04 15:29:42,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:42,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831113902] [2025-03-04 15:29:42,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:42,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:42,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:29:42,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:29:42,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:42,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:42,950 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-04 15:29:42,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:42,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831113902] [2025-03-04 15:29:42,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831113902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:42,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:42,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143383887] [2025-03-04 15:29:42,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:42,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:42,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:42,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:42,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:42,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 68 [2025-03-04 15:29:42,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 367 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:42,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:42,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 68 [2025-03-04 15:29:42,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:43,205 INFO L124 PetriNetUnfolderBase]: 2356/4396 cut-off events. [2025-03-04 15:29:43,205 INFO L125 PetriNetUnfolderBase]: For 2373/2433 co-relation queries the response was YES. [2025-03-04 15:29:43,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10604 conditions, 4396 events. 2356/4396 cut-off events. For 2373/2433 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 28033 event pairs, 1909 based on Foata normal form. 100/4130 useless extension candidates. Maximal degree in co-relation 10584. Up to 2808 conditions per place. [2025-03-04 15:29:43,220 INFO L140 encePairwiseOnDemand]: 63/68 looper letters, 72 selfloop transitions, 7 changer transitions 6/103 dead transitions. [2025-03-04 15:29:43,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 103 transitions, 624 flow [2025-03-04 15:29:43,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2025-03-04 15:29:43,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5404411764705882 [2025-03-04 15:29:43,221 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 367 flow. Second operand 4 states and 147 transitions. [2025-03-04 15:29:43,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 103 transitions, 624 flow [2025-03-04 15:29:43,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 103 transitions, 607 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:43,225 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 377 flow [2025-03-04 15:29:43,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=377, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2025-03-04 15:29:43,225 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places. [2025-03-04 15:29:43,225 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 377 flow [2025-03-04 15:29:43,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:43,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:43,226 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:29:43,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:29:43,226 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:29:43,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:43,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1687389481, now seen corresponding path program 2 times [2025-03-04 15:29:43,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:43,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127179866] [2025-03-04 15:29:43,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:43,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:43,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:29:43,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:29:43,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:43,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:29:43,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:43,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127179866] [2025-03-04 15:29:43,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127179866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:43,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7028354] [2025-03-04 15:29:43,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:43,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:43,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:43,261 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:43,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:29:43,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:29:43,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:29:43,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:43,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:43,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:29:43,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:29:43,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:29:43,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7028354] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:43,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:43,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:29:43,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376042911] [2025-03-04 15:29:43,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:43,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:43,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:43,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:43,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:43,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 68 [2025-03-04 15:29:43,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 377 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:43,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:43,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 68 [2025-03-04 15:29:43,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:43,602 INFO L124 PetriNetUnfolderBase]: 2356/4327 cut-off events. [2025-03-04 15:29:43,602 INFO L125 PetriNetUnfolderBase]: For 1752/1892 co-relation queries the response was YES. [2025-03-04 15:29:43,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10183 conditions, 4327 events. 2356/4327 cut-off events. For 1752/1892 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 27036 event pairs, 1909 based on Foata normal form. 1/3968 useless extension candidates. Maximal degree in co-relation 10162. Up to 3443 conditions per place. [2025-03-04 15:29:43,624 INFO L140 encePairwiseOnDemand]: 63/68 looper letters, 48 selfloop transitions, 16 changer transitions 0/80 dead transitions. [2025-03-04 15:29:43,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 80 transitions, 495 flow [2025-03-04 15:29:43,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:43,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-03-04 15:29:43,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40808823529411764 [2025-03-04 15:29:43,626 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 377 flow. Second operand 4 states and 111 transitions. [2025-03-04 15:29:43,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 80 transitions, 495 flow [2025-03-04 15:29:43,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 80 transitions, 489 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:43,629 INFO L231 Difference]: Finished difference. Result has 83 places, 80 transitions, 393 flow [2025-03-04 15:29:43,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=393, PETRI_PLACES=83, PETRI_TRANSITIONS=80} [2025-03-04 15:29:43,630 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 17 predicate places. [2025-03-04 15:29:43,630 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 80 transitions, 393 flow [2025-03-04 15:29:43,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:43,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:43,630 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:43,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:29:43,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:43,834 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:29:43,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:43,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1189303003, now seen corresponding path program 1 times [2025-03-04 15:29:43,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:43,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54590061] [2025-03-04 15:29:43,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:43,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:43,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:43,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:43,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:43,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:43,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54590061] [2025-03-04 15:29:43,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54590061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:43,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830486537] [2025-03-04 15:29:43,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:43,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:43,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:43,941 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:43,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:29:43,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:43,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:43,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:43,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:43,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:29:44,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:44,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:44,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830486537] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:44,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:44,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 15:29:44,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723398295] [2025-03-04 15:29:44,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:44,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:29:44,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:44,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:29:44,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:29:44,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 68 [2025-03-04 15:29:44,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 393 flow. Second operand has 15 states, 15 states have (on average 20.866666666666667) internal successors, (313), 15 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:44,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:44,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 68 [2025-03-04 15:29:44,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:44,736 INFO L124 PetriNetUnfolderBase]: 3873/7170 cut-off events. [2025-03-04 15:29:44,736 INFO L125 PetriNetUnfolderBase]: For 3082/3222 co-relation queries the response was YES. [2025-03-04 15:29:44,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16781 conditions, 7170 events. 3873/7170 cut-off events. For 3082/3222 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 50014 event pairs, 2603 based on Foata normal form. 232/6770 useless extension candidates. Maximal degree in co-relation 16759. Up to 3245 conditions per place. [2025-03-04 15:29:44,767 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 98 selfloop transitions, 27 changer transitions 16/157 dead transitions. [2025-03-04 15:29:44,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 157 transitions, 1026 flow [2025-03-04 15:29:44,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:29:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:29:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 328 transitions. [2025-03-04 15:29:44,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4019607843137255 [2025-03-04 15:29:44,770 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 393 flow. Second operand 12 states and 328 transitions. [2025-03-04 15:29:44,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 157 transitions, 1026 flow [2025-03-04 15:29:44,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 157 transitions, 994 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:29:44,776 INFO L231 Difference]: Finished difference. Result has 97 places, 95 transitions, 589 flow [2025-03-04 15:29:44,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=589, PETRI_PLACES=97, PETRI_TRANSITIONS=95} [2025-03-04 15:29:44,776 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 31 predicate places. [2025-03-04 15:29:44,776 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 95 transitions, 589 flow [2025-03-04 15:29:44,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 20.866666666666667) internal successors, (313), 15 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:44,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:44,777 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-03-04 15:29:44,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:29:44,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 15:29:44,978 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:29:44,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:44,978 INFO L85 PathProgramCache]: Analyzing trace with hash -318603291, now seen corresponding path program 1 times [2025-03-04 15:29:44,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:44,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942324304] [2025-03-04 15:29:44,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:44,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:44,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:44,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:44,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:44,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:45,112 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-04 15:29:45,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:45,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942324304] [2025-03-04 15:29:45,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942324304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:45,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212451484] [2025-03-04 15:29:45,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:45,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:45,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:45,115 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:45,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:29:45,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:45,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:45,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:45,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:45,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:29:45,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:45,202 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-04 15:29:45,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:45,305 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-04 15:29:45,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212451484] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:45,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:45,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 15:29:45,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113913983] [2025-03-04 15:29:45,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:45,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:29:45,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:45,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:29:45,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:29:45,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 68 [2025-03-04 15:29:45,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 95 transitions, 589 flow. Second operand has 24 states, 24 states have (on average 20.083333333333332) internal successors, (482), 24 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:45,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:45,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 68 [2025-03-04 15:29:45,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:46,028 INFO L124 PetriNetUnfolderBase]: 3849/7235 cut-off events. [2025-03-04 15:29:46,028 INFO L125 PetriNetUnfolderBase]: For 4485/4545 co-relation queries the response was YES. [2025-03-04 15:29:46,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17528 conditions, 7235 events. 3849/7235 cut-off events. For 4485/4545 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 51815 event pairs, 3221 based on Foata normal form. 18/6599 useless extension candidates. Maximal degree in co-relation 17500. Up to 5642 conditions per place. [2025-03-04 15:29:46,075 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 43 selfloop transitions, 84 changer transitions 0/143 dead transitions. [2025-03-04 15:29:46,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 143 transitions, 1281 flow [2025-03-04 15:29:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 15:29:46,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 15:29:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 518 transitions. [2025-03-04 15:29:46,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3462566844919786 [2025-03-04 15:29:46,080 INFO L175 Difference]: Start difference. First operand has 97 places, 95 transitions, 589 flow. Second operand 22 states and 518 transitions. [2025-03-04 15:29:46,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 143 transitions, 1281 flow [2025-03-04 15:29:46,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 143 transitions, 1274 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:46,088 INFO L231 Difference]: Finished difference. Result has 123 places, 143 transitions, 1250 flow [2025-03-04 15:29:46,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1250, PETRI_PLACES=123, PETRI_TRANSITIONS=143} [2025-03-04 15:29:46,089 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 57 predicate places. [2025-03-04 15:29:46,089 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 143 transitions, 1250 flow [2025-03-04 15:29:46,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 20.083333333333332) internal successors, (482), 24 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:46,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:46,089 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-04 15:29:46,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:46,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:46,295 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:29:46,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:46,296 INFO L85 PathProgramCache]: Analyzing trace with hash -160546986, now seen corresponding path program 1 times [2025-03-04 15:29:46,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:46,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690596570] [2025-03-04 15:29:46,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:46,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:46,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:29:46,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:29:46,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:46,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:46,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:46,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690596570] [2025-03-04 15:29:46,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690596570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:46,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725724863] [2025-03-04 15:29:46,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:46,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:46,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:46,404 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:46,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:29:46,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:29:46,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:29:46,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:46,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:46,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:29:46,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:46,489 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-04 15:29:46,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:29:46,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725724863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:46,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:29:46,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2025-03-04 15:29:46,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260492694] [2025-03-04 15:29:46,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:46,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:46,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:46,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:46,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:29:46,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 68 [2025-03-04 15:29:46,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 143 transitions, 1250 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 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-04 15:29:46,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:46,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 68 [2025-03-04 15:29:46,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:46,799 INFO L124 PetriNetUnfolderBase]: 2933/5745 cut-off events. [2025-03-04 15:29:46,799 INFO L125 PetriNetUnfolderBase]: For 3808/3848 co-relation queries the response was YES. [2025-03-04 15:29:46,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13843 conditions, 5745 events. 2933/5745 cut-off events. For 3808/3848 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 41029 event pairs, 2421 based on Foata normal form. 266/5569 useless extension candidates. Maximal degree in co-relation 13808. Up to 4422 conditions per place. [2025-03-04 15:29:46,825 INFO L140 encePairwiseOnDemand]: 65/68 looper letters, 123 selfloop transitions, 1 changer transitions 0/141 dead transitions. [2025-03-04 15:29:46,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 141 transitions, 1490 flow [2025-03-04 15:29:46,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-03-04 15:29:46,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 15:29:46,826 INFO L175 Difference]: Start difference. First operand has 123 places, 143 transitions, 1250 flow. Second operand 3 states and 102 transitions. [2025-03-04 15:29:46,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 141 transitions, 1490 flow [2025-03-04 15:29:46,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 141 transitions, 1272 flow, removed 67 selfloop flow, removed 9 redundant places. [2025-03-04 15:29:46,834 INFO L231 Difference]: Finished difference. Result has 114 places, 141 transitions, 1026 flow [2025-03-04 15:29:46,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1026, PETRI_PLACES=114, PETRI_TRANSITIONS=141} [2025-03-04 15:29:46,834 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 48 predicate places. [2025-03-04 15:29:46,834 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 141 transitions, 1026 flow [2025-03-04 15:29:46,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 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-04 15:29:46,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:46,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:46,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:47,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:47,039 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:29:47,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:47,039 INFO L85 PathProgramCache]: Analyzing trace with hash -681988513, now seen corresponding path program 1 times [2025-03-04 15:29:47,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:47,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645358037] [2025-03-04 15:29:47,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:47,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:47,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:29:47,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:29:47,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:47,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:47,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:47,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645358037] [2025-03-04 15:29:47,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645358037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:47,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715033384] [2025-03-04 15:29:47,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:47,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:47,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:47,475 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:47,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:29:47,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:29:47,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:29:47,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:47,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:47,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:29:47,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:47,572 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-04 15:29:47,765 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:29:47,765 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-04 15:29:47,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:47,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:48,007 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-04 15:29:48,011 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-04 15:29:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:48,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715033384] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:48,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:48,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-03-04 15:29:48,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812717731] [2025-03-04 15:29:48,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:48,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 15:29:48,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:48,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 15:29:48,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2025-03-04 15:29:48,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 68 [2025-03-04 15:29:48,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 141 transitions, 1026 flow. Second operand has 21 states, 21 states have (on average 16.285714285714285) internal successors, (342), 21 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:48,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:48,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 68 [2025-03-04 15:29:48,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:51,437 INFO L124 PetriNetUnfolderBase]: 16243/26786 cut-off events. [2025-03-04 15:29:51,437 INFO L125 PetriNetUnfolderBase]: For 12280/12808 co-relation queries the response was YES. [2025-03-04 15:29:51,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63907 conditions, 26786 events. 16243/26786 cut-off events. For 12280/12808 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 204319 event pairs, 6273 based on Foata normal form. 0/23971 useless extension candidates. Maximal degree in co-relation 63872. Up to 4837 conditions per place. [2025-03-04 15:29:51,641 INFO L140 encePairwiseOnDemand]: 51/68 looper letters, 356 selfloop transitions, 114 changer transitions 43/524 dead transitions. [2025-03-04 15:29:51,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 524 transitions, 3424 flow [2025-03-04 15:29:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-04 15:29:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-04 15:29:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 1000 transitions. [2025-03-04 15:29:51,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35014005602240894 [2025-03-04 15:29:51,644 INFO L175 Difference]: Start difference. First operand has 114 places, 141 transitions, 1026 flow. Second operand 42 states and 1000 transitions. [2025-03-04 15:29:51,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 524 transitions, 3424 flow [2025-03-04 15:29:51,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 524 transitions, 3423 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:51,661 INFO L231 Difference]: Finished difference. Result has 168 places, 174 transitions, 1535 flow [2025-03-04 15:29:51,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=1535, PETRI_PLACES=168, PETRI_TRANSITIONS=174} [2025-03-04 15:29:51,663 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 102 predicate places. [2025-03-04 15:29:51,663 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 174 transitions, 1535 flow [2025-03-04 15:29:51,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 16.285714285714285) internal successors, (342), 21 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:51,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:51,663 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:51,670 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-04 15:29:51,864 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,SelfDestructingSolverStorable13 [2025-03-04 15:29:51,864 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:29:51,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:51,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1005948732, now seen corresponding path program 2 times [2025-03-04 15:29:51,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:51,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767328206] [2025-03-04 15:29:51,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:51,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:51,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 15:29:51,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:29:51,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:29:51,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:29:51,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:51,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767328206] [2025-03-04 15:29:51,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767328206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:51,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080711184] [2025-03-04 15:29:51,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:51,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:51,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:51,932 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:51,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:29:51,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 15:29:51,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:29:51,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:29:51,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:51,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:29:51,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:29:52,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:29:52,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080711184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:52,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:29:52,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 15:29:52,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841380668] [2025-03-04 15:29:52,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:52,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:52,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:52,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:52,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:29:52,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 68 [2025-03-04 15:29:52,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 174 transitions, 1535 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:52,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:52,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 68 [2025-03-04 15:29:52,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:53,862 INFO L124 PetriNetUnfolderBase]: 10584/19384 cut-off events. [2025-03-04 15:29:53,862 INFO L125 PetriNetUnfolderBase]: For 34550/34830 co-relation queries the response was YES. [2025-03-04 15:29:53,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57243 conditions, 19384 events. 10584/19384 cut-off events. For 34550/34830 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 162258 event pairs, 4018 based on Foata normal form. 248/18636 useless extension candidates. Maximal degree in co-relation 57193. Up to 6391 conditions per place. [2025-03-04 15:29:53,985 INFO L140 encePairwiseOnDemand]: 63/68 looper letters, 200 selfloop transitions, 7 changer transitions 0/224 dead transitions. [2025-03-04 15:29:53,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 224 transitions, 2193 flow [2025-03-04 15:29:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2025-03-04 15:29:53,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5220588235294118 [2025-03-04 15:29:53,986 INFO L175 Difference]: Start difference. First operand has 168 places, 174 transitions, 1535 flow. Second operand 4 states and 142 transitions. [2025-03-04 15:29:53,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 224 transitions, 2193 flow [2025-03-04 15:29:54,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 224 transitions, 2023 flow, removed 32 selfloop flow, removed 11 redundant places. [2025-03-04 15:29:54,064 INFO L231 Difference]: Finished difference. Result has 155 places, 173 transitions, 1387 flow [2025-03-04 15:29:54,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1387, PETRI_PLACES=155, PETRI_TRANSITIONS=173} [2025-03-04 15:29:54,065 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 89 predicate places. [2025-03-04 15:29:54,065 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 173 transitions, 1387 flow [2025-03-04 15:29:54,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:54,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:54,065 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] [2025-03-04 15:29:54,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:54,265 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,SelfDestructingSolverStorable14 [2025-03-04 15:29:54,266 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:29:54,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:54,266 INFO L85 PathProgramCache]: Analyzing trace with hash 305160097, now seen corresponding path program 1 times [2025-03-04 15:29:54,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:54,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92424878] [2025-03-04 15:29:54,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:54,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:54,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:29:54,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:29:54,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:54,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:54,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:54,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92424878] [2025-03-04 15:29:54,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92424878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:54,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175196238] [2025-03-04 15:29:54,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:54,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:54,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:54,529 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:54,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:29:54,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:29:54,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:29:54,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:54,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:54,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 15:29:54,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:54,603 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-04 15:29:54,627 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-04 15:29:54,681 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:29:54,682 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-04 15:29:54,829 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 8 treesize of output 1 [2025-03-04 15:29:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:54,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:55,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:29:55,220 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 42 [2025-03-04 15:29:55,228 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:29:55,228 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 62 treesize of output 49 [2025-03-04 15:29:55,241 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 15:29:55,241 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 38 treesize of output 26 [2025-03-04 15:29:55,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:55,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175196238] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:55,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:55,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2025-03-04 15:29:55,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252216258] [2025-03-04 15:29:55,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:55,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 15:29:55,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:55,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 15:29:55,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=509, Unknown=3, NotChecked=0, Total=600 [2025-03-04 15:29:55,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 68 [2025-03-04 15:29:55,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 173 transitions, 1387 flow. Second operand has 25 states, 25 states have (on average 14.4) internal successors, (360), 25 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:55,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:55,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 68 [2025-03-04 15:29:55,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:59,064 INFO L124 PetriNetUnfolderBase]: 16236/26211 cut-off events. [2025-03-04 15:29:59,064 INFO L125 PetriNetUnfolderBase]: For 45947/46361 co-relation queries the response was YES. [2025-03-04 15:29:59,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82591 conditions, 26211 events. 16236/26211 cut-off events. For 45947/46361 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 193648 event pairs, 8150 based on Foata normal form. 376/25690 useless extension candidates. Maximal degree in co-relation 82545. Up to 12265 conditions per place. [2025-03-04 15:29:59,229 INFO L140 encePairwiseOnDemand]: 53/68 looper letters, 264 selfloop transitions, 105 changer transitions 4/381 dead transitions. [2025-03-04 15:29:59,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 381 transitions, 3108 flow [2025-03-04 15:29:59,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 15:29:59,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 15:29:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 550 transitions. [2025-03-04 15:29:59,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31108597285067874 [2025-03-04 15:29:59,230 INFO L175 Difference]: Start difference. First operand has 155 places, 173 transitions, 1387 flow. Second operand 26 states and 550 transitions. [2025-03-04 15:29:59,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 381 transitions, 3108 flow [2025-03-04 15:29:59,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 381 transitions, 3048 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:29:59,401 INFO L231 Difference]: Finished difference. Result has 185 places, 213 transitions, 1974 flow [2025-03-04 15:29:59,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1974, PETRI_PLACES=185, PETRI_TRANSITIONS=213} [2025-03-04 15:29:59,401 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 119 predicate places. [2025-03-04 15:29:59,401 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 213 transitions, 1974 flow [2025-03-04 15:29:59,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 14.4) internal successors, (360), 25 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:59,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:59,402 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] [2025-03-04 15:29:59,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 15:29:59,602 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,SelfDestructingSolverStorable15 [2025-03-04 15:29:59,602 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:29:59,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:59,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1939840361, now seen corresponding path program 1 times [2025-03-04 15:29:59,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:59,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235744029] [2025-03-04 15:29:59,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:59,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:59,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:29:59,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:29:59,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:59,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:59,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:59,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235744029] [2025-03-04 15:29:59,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235744029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:59,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780869693] [2025-03-04 15:29:59,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:59,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:59,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:59,914 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:59,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:29:59,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:29:59,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:29:59,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:59,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:59,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:29:59,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:00,007 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-04 15:30:00,166 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:30:00,167 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 23 treesize of output 10 [2025-03-04 15:30:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:00,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:00,356 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 18 treesize of output 16 [2025-03-04 15:30:00,359 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 22 treesize of output 16 [2025-03-04 15:30:00,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:00,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780869693] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:00,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:00,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-03-04 15:30:00,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874642380] [2025-03-04 15:30:00,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:00,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 15:30:00,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:00,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 15:30:00,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2025-03-04 15:30:00,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 68 [2025-03-04 15:30:00,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 213 transitions, 1974 flow. Second operand has 21 states, 21 states have (on average 18.142857142857142) internal successors, (381), 21 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:00,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:00,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 68 [2025-03-04 15:30:00,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:04,103 INFO L124 PetriNetUnfolderBase]: 13148/22613 cut-off events. [2025-03-04 15:30:04,103 INFO L125 PetriNetUnfolderBase]: For 65398/65757 co-relation queries the response was YES. [2025-03-04 15:30:04,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72216 conditions, 22613 events. 13148/22613 cut-off events. For 65398/65757 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 179000 event pairs, 6171 based on Foata normal form. 394/22410 useless extension candidates. Maximal degree in co-relation 72161. Up to 4766 conditions per place. [2025-03-04 15:30:04,253 INFO L140 encePairwiseOnDemand]: 53/68 looper letters, 373 selfloop transitions, 161 changer transitions 17/566 dead transitions. [2025-03-04 15:30:04,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 566 transitions, 4781 flow [2025-03-04 15:30:04,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 15:30:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-04 15:30:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 974 transitions. [2025-03-04 15:30:04,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37693498452012386 [2025-03-04 15:30:04,255 INFO L175 Difference]: Start difference. First operand has 185 places, 213 transitions, 1974 flow. Second operand 38 states and 974 transitions. [2025-03-04 15:30:04,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 566 transitions, 4781 flow [2025-03-04 15:30:04,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 566 transitions, 4553 flow, removed 101 selfloop flow, removed 11 redundant places. [2025-03-04 15:30:04,537 INFO L231 Difference]: Finished difference. Result has 221 places, 247 transitions, 2566 flow [2025-03-04 15:30:04,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=2566, PETRI_PLACES=221, PETRI_TRANSITIONS=247} [2025-03-04 15:30:04,538 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 155 predicate places. [2025-03-04 15:30:04,538 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 247 transitions, 2566 flow [2025-03-04 15:30:04,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 18.142857142857142) internal successors, (381), 21 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:04,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:04,538 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:04,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 15:30:04,738 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-04 15:30:04,739 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:30:04,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:04,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1119638937, now seen corresponding path program 1 times [2025-03-04 15:30:04,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:04,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987070380] [2025-03-04 15:30:04,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:04,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:04,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:30:04,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:30:04,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:04,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:04,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:30:04,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:04,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987070380] [2025-03-04 15:30:04,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987070380] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:04,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90452667] [2025-03-04 15:30:04,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:04,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:04,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:04,788 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:30:04,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 15:30:04,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:30:04,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:30:04,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:04,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:04,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:30:04,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:30:04,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:04,911 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:30:04,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90452667] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:04,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:04,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:30:04,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090496466] [2025-03-04 15:30:04,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:04,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:30:04,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:04,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:30:04,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:30:04,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 68 [2025-03-04 15:30:04,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 247 transitions, 2566 flow. Second operand has 12 states, 12 states have (on average 23.0) internal successors, (276), 12 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:04,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:04,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 68 [2025-03-04 15:30:04,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:08,163 INFO L124 PetriNetUnfolderBase]: 15658/28689 cut-off events. [2025-03-04 15:30:08,163 INFO L125 PetriNetUnfolderBase]: For 66793/67912 co-relation queries the response was YES. [2025-03-04 15:30:08,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84811 conditions, 28689 events. 15658/28689 cut-off events. For 66793/67912 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 239504 event pairs, 4732 based on Foata normal form. 10/27637 useless extension candidates. Maximal degree in co-relation 84750. Up to 10756 conditions per place. [2025-03-04 15:30:08,384 INFO L140 encePairwiseOnDemand]: 63/68 looper letters, 475 selfloop transitions, 13 changer transitions 0/512 dead transitions. [2025-03-04 15:30:08,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 512 transitions, 5331 flow [2025-03-04 15:30:08,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:30:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:30:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 373 transitions. [2025-03-04 15:30:08,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5485294117647059 [2025-03-04 15:30:08,385 INFO L175 Difference]: Start difference. First operand has 221 places, 247 transitions, 2566 flow. Second operand 10 states and 373 transitions. [2025-03-04 15:30:08,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 512 transitions, 5331 flow [2025-03-04 15:30:08,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 512 transitions, 5118 flow, removed 37 selfloop flow, removed 16 redundant places. [2025-03-04 15:30:08,584 INFO L231 Difference]: Finished difference. Result has 217 places, 256 transitions, 2512 flow [2025-03-04 15:30:08,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2432, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2512, PETRI_PLACES=217, PETRI_TRANSITIONS=256} [2025-03-04 15:30:08,585 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 151 predicate places. [2025-03-04 15:30:08,585 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 256 transitions, 2512 flow [2025-03-04 15:30:08,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.0) internal successors, (276), 12 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:08,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:08,585 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, 1] [2025-03-04 15:30:08,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:30:08,785 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-04 15:30:08,785 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:30:08,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:08,786 INFO L85 PathProgramCache]: Analyzing trace with hash -816625014, now seen corresponding path program 1 times [2025-03-04 15:30:08,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:08,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53343035] [2025-03-04 15:30:08,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:08,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:08,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:30:08,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:30:08,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:08,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:09,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:09,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53343035] [2025-03-04 15:30:09,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53343035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:09,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509732377] [2025-03-04 15:30:09,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:09,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:09,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:09,611 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:30:09,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 15:30:09,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:30:09,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:30:09,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:09,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:09,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:30:09,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:09,720 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-04 15:30:09,968 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:30:09,968 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-04 15:30:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:09,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:10,179 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-04 15:30:10,183 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-04 15:30:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:10,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509732377] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:10,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:10,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 28 [2025-03-04 15:30:10,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133162917] [2025-03-04 15:30:10,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:10,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 15:30:10,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:10,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 15:30:10,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2025-03-04 15:30:10,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 68 [2025-03-04 15:30:10,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 256 transitions, 2512 flow. Second operand has 30 states, 30 states have (on average 17.1) internal successors, (513), 30 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:10,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:10,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 68 [2025-03-04 15:30:10,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:17,630 INFO L124 PetriNetUnfolderBase]: 30487/49667 cut-off events. [2025-03-04 15:30:17,631 INFO L125 PetriNetUnfolderBase]: For 169061/171209 co-relation queries the response was YES. [2025-03-04 15:30:18,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169158 conditions, 49667 events. 30487/49667 cut-off events. For 169061/171209 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 400028 event pairs, 4331 based on Foata normal form. 8/47556 useless extension candidates. Maximal degree in co-relation 169096. Up to 16614 conditions per place. [2025-03-04 15:30:18,466 INFO L140 encePairwiseOnDemand]: 52/68 looper letters, 659 selfloop transitions, 170 changer transitions 9/858 dead transitions. [2025-03-04 15:30:18,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 858 transitions, 7785 flow [2025-03-04 15:30:18,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-04 15:30:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-03-04 15:30:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 1008 transitions. [2025-03-04 15:30:18,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3615494978479197 [2025-03-04 15:30:18,468 INFO L175 Difference]: Start difference. First operand has 217 places, 256 transitions, 2512 flow. Second operand 41 states and 1008 transitions. [2025-03-04 15:30:18,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 858 transitions, 7785 flow [2025-03-04 15:30:19,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 858 transitions, 7297 flow, removed 176 selfloop flow, removed 3 redundant places. [2025-03-04 15:30:19,348 INFO L231 Difference]: Finished difference. Result has 267 places, 308 transitions, 3250 flow [2025-03-04 15:30:19,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2482, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=3250, PETRI_PLACES=267, PETRI_TRANSITIONS=308} [2025-03-04 15:30:19,348 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 201 predicate places. [2025-03-04 15:30:19,348 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 308 transitions, 3250 flow [2025-03-04 15:30:19,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 17.1) internal successors, (513), 30 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:19,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:19,349 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, 1] [2025-03-04 15:30:19,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:30:19,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:19,549 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:30:19,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:19,550 INFO L85 PathProgramCache]: Analyzing trace with hash 274882192, now seen corresponding path program 1 times [2025-03-04 15:30:19,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:19,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938807638] [2025-03-04 15:30:19,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:19,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:19,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:30:19,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:30:19,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:19,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:20,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:20,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938807638] [2025-03-04 15:30:20,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938807638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:20,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908436146] [2025-03-04 15:30:20,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:20,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:20,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:20,288 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:30:20,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 15:30:20,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:30:20,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:30:20,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:20,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:20,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:30:20,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:20,398 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-04 15:30:20,625 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:30:20,626 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-04 15:30:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:20,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:20,837 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-04 15:30:20,839 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-04 15:30:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:20,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908436146] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:20,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:20,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 28 [2025-03-04 15:30:20,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13031038] [2025-03-04 15:30:20,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:20,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 15:30:20,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:20,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 15:30:20,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2025-03-04 15:30:21,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 68 [2025-03-04 15:30:21,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 308 transitions, 3250 flow. Second operand has 30 states, 30 states have (on average 17.0) internal successors, (510), 30 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:21,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:21,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 68 [2025-03-04 15:30:21,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:29,981 INFO L124 PetriNetUnfolderBase]: 35935/57952 cut-off events. [2025-03-04 15:30:29,981 INFO L125 PetriNetUnfolderBase]: For 224309/227085 co-relation queries the response was YES. [2025-03-04 15:30:30,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210800 conditions, 57952 events. 35935/57952 cut-off events. For 224309/227085 co-relation queries the response was YES. Maximal size of possible extension queue 1843. Compared 473042 event pairs, 4385 based on Foata normal form. 605/58552 useless extension candidates. Maximal degree in co-relation 210724. Up to 17057 conditions per place. [2025-03-04 15:30:31,028 INFO L140 encePairwiseOnDemand]: 52/68 looper letters, 578 selfloop transitions, 218 changer transitions 9/825 dead transitions. [2025-03-04 15:30:31,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 825 transitions, 7631 flow [2025-03-04 15:30:31,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-04 15:30:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-03-04 15:30:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 1055 transitions. [2025-03-04 15:30:31,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36080711354309164 [2025-03-04 15:30:31,030 INFO L175 Difference]: Start difference. First operand has 267 places, 308 transitions, 3250 flow. Second operand 43 states and 1055 transitions. [2025-03-04 15:30:31,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 825 transitions, 7631 flow [2025-03-04 15:30:32,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 825 transitions, 7428 flow, removed 23 selfloop flow, removed 16 redundant places. [2025-03-04 15:30:32,973 INFO L231 Difference]: Finished difference. Result has 307 places, 359 transitions, 4053 flow [2025-03-04 15:30:32,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3065, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=4053, PETRI_PLACES=307, PETRI_TRANSITIONS=359} [2025-03-04 15:30:32,973 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 241 predicate places. [2025-03-04 15:30:32,974 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 359 transitions, 4053 flow [2025-03-04 15:30:32,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 17.0) internal successors, (510), 30 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:32,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:32,974 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, 1, 1] [2025-03-04 15:30:32,980 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-04 15:30:33,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:33,174 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:30:33,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:33,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1917945446, now seen corresponding path program 1 times [2025-03-04 15:30:33,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:33,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914225606] [2025-03-04 15:30:33,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:33,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:33,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:30:33,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:30:33,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:33,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:33,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:33,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914225606] [2025-03-04 15:30:33,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914225606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:33,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601911873] [2025-03-04 15:30:33,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:33,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:33,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:33,893 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:30:33,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 15:30:33,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:30:33,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:30:33,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:33,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:33,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:30:33,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:34,013 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-04 15:30:34,253 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:30:34,253 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 23 treesize of output 10 [2025-03-04 15:30:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:34,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:34,525 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 18 treesize of output 16 [2025-03-04 15:30:34,528 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 22 treesize of output 16 [2025-03-04 15:30:34,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:34,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601911873] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:34,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:34,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 28 [2025-03-04 15:30:34,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601699601] [2025-03-04 15:30:34,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:34,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 15:30:34,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:34,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 15:30:34,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2025-03-04 15:30:34,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 68 [2025-03-04 15:30:34,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 359 transitions, 4053 flow. Second operand has 30 states, 30 states have (on average 18.0) internal successors, (540), 30 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:34,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:34,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 68 [2025-03-04 15:30:34,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand