./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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/pthread/queue_ok_longest.i -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 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:21:04,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:21:04,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:21:04,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:21:04,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:21:04,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:21:04,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:21:04,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:21:04,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:21:04,242 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:21:04,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:21:04,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:21:04,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:21:04,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:21:04,243 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:21:04,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:21:04,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:21:04,244 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:21:04,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:21:04,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:21:04,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:21:04,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:21:04,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:21:04,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:21:04,244 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:21:04,245 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:21:04,245 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:21:04,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:21:04,245 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:21:04,245 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:21:04,245 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:21:04,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:21:04,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:21:04,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:21:04,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:21:04,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:21:04,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:21:04,246 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:21:04,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:21:04,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:21:04,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:21:04,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:21:04,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:21:04,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:21:04,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:21:04,247 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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2025-03-09 06:21:04,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:21:04,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:21:04,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:21:04,486 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:21:04,487 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:21:04,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok_longest.i [2025-03-09 06:21:05,604 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e788391da/e78d20e7f9704f61b25e6d4bf19ebb35/FLAGf881ec471 [2025-03-09 06:21:05,851 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:21:05,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longest.i [2025-03-09 06:21:05,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e788391da/e78d20e7f9704f61b25e6d4bf19ebb35/FLAGf881ec471 [2025-03-09 06:21:06,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e788391da/e78d20e7f9704f61b25e6d4bf19ebb35 [2025-03-09 06:21:06,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:21:06,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:21:06,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:21:06,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:21:06,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:21:06,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:21:06" (1/1) ... [2025-03-09 06:21:06,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1322b94d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:06, skipping insertion in model container [2025-03-09 06:21:06,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:21:06" (1/1) ... [2025-03-09 06:21:06,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:21:06,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:21:06,492 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:21:06,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:21:06,643 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:21:06,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:06 WrapperNode [2025-03-09 06:21:06,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:21:06,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:21:06,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:21:06,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:21:06,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:06" (1/1) ... [2025-03-09 06:21:06,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:06" (1/1) ... [2025-03-09 06:21:06,764 INFO L138 Inliner]: procedures = 274, calls = 1654, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1807 [2025-03-09 06:21:06,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:21:06,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:21:06,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:21:06,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:21:06,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:06" (1/1) ... [2025-03-09 06:21:06,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:06" (1/1) ... [2025-03-09 06:21:06,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:06" (1/1) ... [2025-03-09 06:21:06,830 INFO L175 MemorySlicer]: Split 1635 memory accesses to 4 slices as follows [2, 5, 802, 826]. 51 percent of accesses are in the largest equivalence class. The 1610 initializations are split as follows [2, 5, 800, 803]. The 11 writes are split as follows [0, 0, 1, 10]. [2025-03-09 06:21:06,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:06" (1/1) ... [2025-03-09 06:21:06,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:06" (1/1) ... [2025-03-09 06:21:06,866 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:06" (1/1) ... [2025-03-09 06:21:06,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:06" (1/1) ... [2025-03-09 06:21:06,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:06" (1/1) ... [2025-03-09 06:21:06,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:06" (1/1) ... [2025-03-09 06:21:06,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:21:06,903 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:21:06,903 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:21:06,903 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:21:06,904 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:06" (1/1) ... [2025-03-09 06:21:06,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:21:06,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:06,930 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-09 06:21:06,933 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-09 06:21:06,950 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-09 06:21:06,951 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-09 06:21:06,951 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-09 06:21:06,951 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-09 06:21:06,951 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 06:21:06,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:21:06,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:21:06,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:21:06,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 06:21:06,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:21:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:21:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:21:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 06:21:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 06:21:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:21:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:21:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:21:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:21:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 06:21:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:21:06,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:21:06,954 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:21:07,089 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:21:07,090 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:21:08,622 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:21:08,622 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:21:32,105 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:21:32,106 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:21:32,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:21:32 BoogieIcfgContainer [2025-03-09 06:21:32,106 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:21:32,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:21:32,109 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:21:32,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:21:32,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:21:06" (1/3) ... [2025-03-09 06:21:32,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea2a5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:21:32, skipping insertion in model container [2025-03-09 06:21:32,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:06" (2/3) ... [2025-03-09 06:21:32,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea2a5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:21:32, skipping insertion in model container [2025-03-09 06:21:32,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:21:32" (3/3) ... [2025-03-09 06:21:32,116 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2025-03-09 06:21:32,140 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:21:32,143 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok_longest.i that has 3 procedures, 55 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-03-09 06:21:32,144 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:21:32,267 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 06:21:32,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 61 transitions, 136 flow [2025-03-09 06:21:32,389 INFO L124 PetriNetUnfolderBase]: 7/59 cut-off events. [2025-03-09 06:21:32,392 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 06:21:32,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 59 events. 7/59 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 169 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2025-03-09 06:21:32,397 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 61 transitions, 136 flow [2025-03-09 06:21:32,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 57 transitions, 123 flow [2025-03-09 06:21:32,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:21:32,429 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;@10be55e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:21:32,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-09 06:21:32,491 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:21:32,492 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-03-09 06:21:32,492 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:21:32,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:32,493 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:32,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-09 06:21:32,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:32,500 INFO L85 PathProgramCache]: Analyzing trace with hash 878084973, now seen corresponding path program 1 times [2025-03-09 06:21:32,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:32,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320284091] [2025-03-09 06:21:32,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:32,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:32,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:21:33,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:21:33,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:33,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:34,725 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-09 06:21:34,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:34,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320284091] [2025-03-09 06:21:34,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320284091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:34,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:34,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:21:34,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16210391] [2025-03-09 06:21:34,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:34,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:21:34,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:34,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:21:34,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:21:34,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-09 06:21:34,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:34,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:34,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-09 06:21:34,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:35,821 INFO L124 PetriNetUnfolderBase]: 1024/2065 cut-off events. [2025-03-09 06:21:35,821 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-09 06:21:35,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3716 conditions, 2065 events. 1024/2065 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13304 event pairs, 211 based on Foata normal form. 28/1697 useless extension candidates. Maximal degree in co-relation 3574. Up to 1033 conditions per place. [2025-03-09 06:21:35,833 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 73 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2025-03-09 06:21:35,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 99 transitions, 372 flow [2025-03-09 06:21:35,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:21:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:21:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2025-03-09 06:21:35,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7008196721311475 [2025-03-09 06:21:35,843 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 123 flow. Second operand 4 states and 171 transitions. [2025-03-09 06:21:35,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 99 transitions, 372 flow [2025-03-09 06:21:35,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 99 transitions, 363 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:21:35,849 INFO L231 Difference]: Finished difference. Result has 60 places, 61 transitions, 156 flow [2025-03-09 06:21:35,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=60, PETRI_TRANSITIONS=61} [2025-03-09 06:21:35,853 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2025-03-09 06:21:35,853 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 156 flow [2025-03-09 06:21:35,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:35,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:35,854 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:35,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:21:35,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-09 06:21:35,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:35,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1450834084, now seen corresponding path program 1 times [2025-03-09 06:21:35,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:35,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188848913] [2025-03-09 06:21:35,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:35,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:35,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:21:36,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:21:36,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:36,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:36,998 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-09 06:21:36,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:36,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188848913] [2025-03-09 06:21:36,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188848913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:36,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:36,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:21:36,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833894774] [2025-03-09 06:21:36,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:36,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:21:36,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:36,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:21:36,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:21:37,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-09 06:21:37,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:37,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:37,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-09 06:21:37,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:37,575 INFO L124 PetriNetUnfolderBase]: 1019/2078 cut-off events. [2025-03-09 06:21:37,575 INFO L125 PetriNetUnfolderBase]: For 429/433 co-relation queries the response was YES. [2025-03-09 06:21:37,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4044 conditions, 2078 events. 1019/2078 cut-off events. For 429/433 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13398 event pairs, 215 based on Foata normal form. 46/1828 useless extension candidates. Maximal degree in co-relation 2603. Up to 1122 conditions per place. [2025-03-09 06:21:37,583 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 81 selfloop transitions, 6 changer transitions 0/108 dead transitions. [2025-03-09 06:21:37,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 108 transitions, 435 flow [2025-03-09 06:21:37,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:21:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:21:37,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 204 transitions. [2025-03-09 06:21:37,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6688524590163935 [2025-03-09 06:21:37,585 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 156 flow. Second operand 5 states and 204 transitions. [2025-03-09 06:21:37,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 108 transitions, 435 flow [2025-03-09 06:21:37,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 108 transitions, 430 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:21:37,588 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 174 flow [2025-03-09 06:21:37,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2025-03-09 06:21:37,589 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2025-03-09 06:21:37,589 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 174 flow [2025-03-09 06:21:37,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:37,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:37,589 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:37,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:21:37,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-09 06:21:37,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:37,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1612696120, now seen corresponding path program 1 times [2025-03-09 06:21:37,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:37,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679066256] [2025-03-09 06:21:37,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:37,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:37,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:21:37,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:21:37,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:37,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:38,405 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-09 06:21:38,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:38,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679066256] [2025-03-09 06:21:38,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679066256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:38,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:38,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:21:38,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832216911] [2025-03-09 06:21:38,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:38,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:21:38,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:38,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:21:38,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:21:38,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-09 06:21:38,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-09 06:21:38,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:38,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-09 06:21:38,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:40,192 INFO L124 PetriNetUnfolderBase]: 1147/2320 cut-off events. [2025-03-09 06:21:40,192 INFO L125 PetriNetUnfolderBase]: For 539/547 co-relation queries the response was YES. [2025-03-09 06:21:40,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4598 conditions, 2320 events. 1147/2320 cut-off events. For 539/547 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14862 event pairs, 209 based on Foata normal form. 50/2028 useless extension candidates. Maximal degree in co-relation 3108. Up to 1202 conditions per place. [2025-03-09 06:21:40,211 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 108 selfloop transitions, 11 changer transitions 0/140 dead transitions. [2025-03-09 06:21:40,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 140 transitions, 589 flow [2025-03-09 06:21:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:21:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:21:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 283 transitions. [2025-03-09 06:21:40,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6627634660421545 [2025-03-09 06:21:40,215 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 174 flow. Second operand 7 states and 283 transitions. [2025-03-09 06:21:40,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 140 transitions, 589 flow [2025-03-09 06:21:40,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 140 transitions, 576 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-09 06:21:40,220 INFO L231 Difference]: Finished difference. Result has 70 places, 68 transitions, 230 flow [2025-03-09 06:21:40,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=230, PETRI_PLACES=70, PETRI_TRANSITIONS=68} [2025-03-09 06:21:40,221 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2025-03-09 06:21:40,222 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 230 flow [2025-03-09 06:21:40,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-09 06:21:40,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:40,222 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:40,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:21:40,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-09 06:21:40,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:40,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1140833261, now seen corresponding path program 1 times [2025-03-09 06:21:40,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:40,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960265470] [2025-03-09 06:21:40,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:40,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:40,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:21:40,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:21:40,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:40,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:40,514 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-09 06:21:40,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:40,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960265470] [2025-03-09 06:21:40,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960265470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:40,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:40,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:21:40,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618088992] [2025-03-09 06:21:40,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:40,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:21:40,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:40,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:21:40,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:21:40,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 61 [2025-03-09 06:21:40,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-09 06:21:40,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:40,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 61 [2025-03-09 06:21:40,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:40,949 INFO L124 PetriNetUnfolderBase]: 515/1161 cut-off events. [2025-03-09 06:21:40,949 INFO L125 PetriNetUnfolderBase]: For 370/370 co-relation queries the response was YES. [2025-03-09 06:21:40,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2431 conditions, 1161 events. 515/1161 cut-off events. For 370/370 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6804 event pairs, 296 based on Foata normal form. 29/1084 useless extension candidates. Maximal degree in co-relation 2349. Up to 510 conditions per place. [2025-03-09 06:21:40,954 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 42 selfloop transitions, 2 changer transitions 6/73 dead transitions. [2025-03-09 06:21:40,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 317 flow [2025-03-09 06:21:40,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:21:40,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:21:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-03-09 06:21:40,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6557377049180327 [2025-03-09 06:21:40,955 INFO L175 Difference]: Start difference. First operand has 70 places, 68 transitions, 230 flow. Second operand 3 states and 120 transitions. [2025-03-09 06:21:40,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 317 flow [2025-03-09 06:21:40,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 73 transitions, 300 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-09 06:21:40,959 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 183 flow [2025-03-09 06:21:40,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2025-03-09 06:21:40,959 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2025-03-09 06:21:40,959 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 183 flow [2025-03-09 06:21:40,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-09 06:21:40,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:40,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:40,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:21:40,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-09 06:21:40,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:40,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1546030545, now seen corresponding path program 1 times [2025-03-09 06:21:40,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:40,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496854642] [2025-03-09 06:21:40,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:40,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:40,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:21:41,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:21:41,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:41,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:41,262 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-09 06:21:41,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:41,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496854642] [2025-03-09 06:21:41,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496854642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:41,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:41,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:21:41,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710000093] [2025-03-09 06:21:41,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:41,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:21:41,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:41,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:21:41,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:21:41,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-09 06:21:41,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-09 06:21:41,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:41,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-09 06:21:41,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:42,400 INFO L124 PetriNetUnfolderBase]: 440/978 cut-off events. [2025-03-09 06:21:42,400 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-09 06:21:42,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 978 events. 440/978 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5184 event pairs, 293 based on Foata normal form. 24/931 useless extension candidates. Maximal degree in co-relation 1867. Up to 591 conditions per place. [2025-03-09 06:21:42,406 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 53 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-03-09 06:21:42,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 77 transitions, 325 flow [2025-03-09 06:21:42,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:21:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:21:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2025-03-09 06:21:42,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6188524590163934 [2025-03-09 06:21:42,409 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 183 flow. Second operand 4 states and 151 transitions. [2025-03-09 06:21:42,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 77 transitions, 325 flow [2025-03-09 06:21:42,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 77 transitions, 319 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 06:21:42,412 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 195 flow [2025-03-09 06:21:42,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2025-03-09 06:21:42,413 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2025-03-09 06:21:42,414 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 195 flow [2025-03-09 06:21:42,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-09 06:21:42,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:42,414 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:42,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:21:42,415 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-09 06:21:42,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:42,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1429632689, now seen corresponding path program 1 times [2025-03-09 06:21:42,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:42,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808698453] [2025-03-09 06:21:42,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:42,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:42,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:21:42,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:21:42,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:42,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:43,342 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-09 06:21:43,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:43,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808698453] [2025-03-09 06:21:43,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808698453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:43,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:43,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:21:43,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207156880] [2025-03-09 06:21:43,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:43,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:21:43,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:43,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:21:43,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:21:43,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 61 [2025-03-09 06:21:43,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 63 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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-09 06:21:43,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:43,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 61 [2025-03-09 06:21:43,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:44,116 INFO L124 PetriNetUnfolderBase]: 398/936 cut-off events. [2025-03-09 06:21:44,117 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2025-03-09 06:21:44,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 936 events. 398/936 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5002 event pairs, 118 based on Foata normal form. 12/895 useless extension candidates. Maximal degree in co-relation 1451. Up to 457 conditions per place. [2025-03-09 06:21:44,121 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 55 selfloop transitions, 5 changer transitions 3/86 dead transitions. [2025-03-09 06:21:44,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 86 transitions, 371 flow [2025-03-09 06:21:44,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:21:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:21:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2025-03-09 06:21:44,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6131147540983607 [2025-03-09 06:21:44,122 INFO L175 Difference]: Start difference. First operand has 70 places, 63 transitions, 195 flow. Second operand 5 states and 187 transitions. [2025-03-09 06:21:44,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 86 transitions, 371 flow [2025-03-09 06:21:44,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 86 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:21:44,125 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 198 flow [2025-03-09 06:21:44,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2025-03-09 06:21:44,126 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2025-03-09 06:21:44,126 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 198 flow [2025-03-09 06:21:44,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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-09 06:21:44,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:44,126 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:44,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:21:44,127 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-09 06:21:44,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:44,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1073174039, now seen corresponding path program 1 times [2025-03-09 06:21:44,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:44,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460551961] [2025-03-09 06:21:44,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:44,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:44,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:21:44,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:21:44,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:44,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:45,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:45,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460551961] [2025-03-09 06:21:45,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460551961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:45,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660474917] [2025-03-09 06:21:45,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:45,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:45,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:45,171 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-09 06:21:45,172 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-09 06:21:45,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:21:45,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:21:45,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:45,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:45,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 3391 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-09 06:21:45,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:45,719 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 19 treesize of output 1 [2025-03-09 06:21:45,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-09 06:21:45,806 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 34 treesize of output 28 [2025-03-09 06:21:45,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:21:45,815 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 22 [2025-03-09 06:21:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:45,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:21:46,090 INFO L349 Elim1Store]: treesize reduction 47, result has 53.5 percent of original size [2025-03-09 06:21:46,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 184 [2025-03-09 06:21:46,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:21:46,117 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 144 treesize of output 140 [2025-03-09 06:21:46,182 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 10 treesize of output 6 [2025-03-09 06:21:46,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:21:46,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 184 [2025-03-09 06:21:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:46,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660474917] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:21:46,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:21:46,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-09 06:21:46,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552599766] [2025-03-09 06:21:46,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:21:46,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 06:21:46,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:46,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 06:21:46,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-09 06:21:46,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-03-09 06:21:46,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 198 flow. Second operand has 16 states, 16 states have (on average 24.1875) internal successors, (387), 16 states have internal predecessors, (387), 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-09 06:21:46,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:46,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-03-09 06:21:46,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:48,252 INFO L124 PetriNetUnfolderBase]: 482/1083 cut-off events. [2025-03-09 06:21:48,252 INFO L125 PetriNetUnfolderBase]: For 231/231 co-relation queries the response was YES. [2025-03-09 06:21:48,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2357 conditions, 1083 events. 482/1083 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5527 event pairs, 209 based on Foata normal form. 12/1017 useless extension candidates. Maximal degree in co-relation 1750. Up to 411 conditions per place. [2025-03-09 06:21:48,257 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 56 selfloop transitions, 8 changer transitions 0/84 dead transitions. [2025-03-09 06:21:48,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 84 transitions, 373 flow [2025-03-09 06:21:48,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:21:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:21:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2025-03-09 06:21:48,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5218579234972678 [2025-03-09 06:21:48,261 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 198 flow. Second operand 6 states and 191 transitions. [2025-03-09 06:21:48,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 84 transitions, 373 flow [2025-03-09 06:21:48,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 84 transitions, 363 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 06:21:48,263 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 210 flow [2025-03-09 06:21:48,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2025-03-09 06:21:48,266 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 17 predicate places. [2025-03-09 06:21:48,266 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 210 flow [2025-03-09 06:21:48,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 24.1875) internal successors, (387), 16 states have internal predecessors, (387), 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-09 06:21:48,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:48,267 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:48,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 06:21:48,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:48,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-09 06:21:48,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:48,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1091346856, now seen corresponding path program 1 times [2025-03-09 06:21:48,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:48,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646334890] [2025-03-09 06:21:48,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:48,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:48,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:21:48,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:21:48,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:48,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:50,792 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-09 06:21:50,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:50,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646334890] [2025-03-09 06:21:50,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646334890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:50,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833751541] [2025-03-09 06:21:50,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:50,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:50,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:50,795 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-09 06:21:50,796 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-09 06:21:50,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:21:51,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:21:51,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:51,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:51,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 3392 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-09 06:21:51,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:51,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2025-03-09 06:21:51,257 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 06:21:51,275 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-09 06:21:51,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2025-03-09 06:21:51,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:21:51,324 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 06:21:51,326 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 06:21:51,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 27 [2025-03-09 06:21:51,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:21:51,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2025-03-09 06:21:51,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:21:51,437 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 28 treesize of output 10 [2025-03-09 06:21:51,440 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-09 06:21:51,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:21:51,714 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-09 06:21:51,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833751541] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:21:51,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:21:51,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-03-09 06:21:51,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044582365] [2025-03-09 06:21:51,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:21:51,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 06:21:51,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:51,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:21:51,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-03-09 06:21:51,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2025-03-09 06:21:51,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 210 flow. Second operand has 19 states, 19 states have (on average 23.0) internal successors, (437), 19 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:51,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:51,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2025-03-09 06:21:51,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:55,542 INFO L124 PetriNetUnfolderBase]: 849/1892 cut-off events. [2025-03-09 06:21:55,542 INFO L125 PetriNetUnfolderBase]: For 741/741 co-relation queries the response was YES. [2025-03-09 06:21:55,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4261 conditions, 1892 events. 849/1892 cut-off events. For 741/741 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 10861 event pairs, 143 based on Foata normal form. 24/1788 useless extension candidates. Maximal degree in co-relation 3407. Up to 565 conditions per place. [2025-03-09 06:21:55,623 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 137 selfloop transitions, 15 changer transitions 3/174 dead transitions. [2025-03-09 06:21:55,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 174 transitions, 825 flow [2025-03-09 06:21:55,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 06:21:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 06:21:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 429 transitions. [2025-03-09 06:21:55,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5409836065573771 [2025-03-09 06:21:55,626 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 210 flow. Second operand 13 states and 429 transitions. [2025-03-09 06:21:55,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 174 transitions, 825 flow [2025-03-09 06:21:55,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 174 transitions, 808 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:21:55,634 INFO L231 Difference]: Finished difference. Result has 88 places, 72 transitions, 308 flow [2025-03-09 06:21:55,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=308, PETRI_PLACES=88, PETRI_TRANSITIONS=72} [2025-03-09 06:21:55,637 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2025-03-09 06:21:55,637 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 72 transitions, 308 flow [2025-03-09 06:21:55,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 23.0) internal successors, (437), 19 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:55,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:55,638 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:55,654 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-09 06:21:55,838 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,SelfDestructingSolverStorable7 [2025-03-09 06:21:55,839 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-09 06:21:55,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:55,839 INFO L85 PathProgramCache]: Analyzing trace with hash 812428748, now seen corresponding path program 1 times [2025-03-09 06:21:55,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:55,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912958568] [2025-03-09 06:21:55,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:55,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:55,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:21:55,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:21:55,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:55,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:57,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:57,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912958568] [2025-03-09 06:21:57,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912958568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:57,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327733179] [2025-03-09 06:21:57,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:57,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:57,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:57,625 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-09 06:21:57,626 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-09 06:21:57,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:21:58,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:21:58,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:58,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:58,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 3404 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 06:21:58,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:58,057 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 35 treesize of output 9 [2025-03-09 06:21:58,105 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 06:21:58,114 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-09 06:21:58,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2025-03-09 06:21:58,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 06:21:58,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 3 [2025-03-09 06:21:58,273 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-09 06:21:58,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 40 [2025-03-09 06:21:58,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 40 treesize of output 18 [2025-03-09 06:21:58,312 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 30 treesize of output 12 [2025-03-09 06:21:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:58,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:22:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:02,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327733179] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:22:02,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:22:02,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 20 [2025-03-09 06:22:02,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657128196] [2025-03-09 06:22:02,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:22:02,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 06:22:02,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:02,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 06:22:02,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=350, Unknown=1, NotChecked=0, Total=462 [2025-03-09 06:22:02,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-03-09 06:22:02,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 72 transitions, 308 flow. Second operand has 22 states, 22 states have (on average 24.136363636363637) internal successors, (531), 22 states have internal predecessors, (531), 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-09 06:22:02,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:02,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-03-09 06:22:02,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:07,333 INFO L124 PetriNetUnfolderBase]: 1458/3239 cut-off events. [2025-03-09 06:22:07,337 INFO L125 PetriNetUnfolderBase]: For 1567/1567 co-relation queries the response was YES. [2025-03-09 06:22:07,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7709 conditions, 3239 events. 1458/3239 cut-off events. For 1567/1567 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 21406 event pairs, 203 based on Foata normal form. 36/3072 useless extension candidates. Maximal degree in co-relation 6381. Up to 633 conditions per place. [2025-03-09 06:22:07,394 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 173 selfloop transitions, 34 changer transitions 3/229 dead transitions. [2025-03-09 06:22:07,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 229 transitions, 1178 flow [2025-03-09 06:22:07,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 06:22:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-09 06:22:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 592 transitions. [2025-03-09 06:22:07,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5391621129326047 [2025-03-09 06:22:07,400 INFO L175 Difference]: Start difference. First operand has 88 places, 72 transitions, 308 flow. Second operand 18 states and 592 transitions. [2025-03-09 06:22:07,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 229 transitions, 1178 flow [2025-03-09 06:22:07,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 229 transitions, 1142 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-03-09 06:22:07,411 INFO L231 Difference]: Finished difference. Result has 102 places, 91 transitions, 491 flow [2025-03-09 06:22:07,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=491, PETRI_PLACES=102, PETRI_TRANSITIONS=91} [2025-03-09 06:22:07,412 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 45 predicate places. [2025-03-09 06:22:07,412 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 91 transitions, 491 flow [2025-03-09 06:22:07,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 24.136363636363637) internal successors, (531), 22 states have internal predecessors, (531), 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-09 06:22:07,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:07,414 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:07,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 06:22:07,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:07,615 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-09 06:22:07,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:07,618 INFO L85 PathProgramCache]: Analyzing trace with hash -584509875, now seen corresponding path program 1 times [2025-03-09 06:22:07,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:07,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110149508] [2025-03-09 06:22:07,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:07,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:07,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:22:07,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:22:07,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:07,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:08,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:08,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110149508] [2025-03-09 06:22:08,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110149508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:22:08,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39536453] [2025-03-09 06:22:08,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:08,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:08,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:08,028 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-09 06:22:08,038 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-09 06:22:08,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:22:08,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:22:08,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:08,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:08,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 3415 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:22:08,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:22:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:08,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:22:08,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39536453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:08,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:22:08,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 06:22:08,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514268073] [2025-03-09 06:22:08,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:08,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:22:08,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:08,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:22:08,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:22:08,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-09 06:22:08,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 91 transitions, 491 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 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-09 06:22:08,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:08,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-09 06:22:08,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:09,928 INFO L124 PetriNetUnfolderBase]: 1383/3100 cut-off events. [2025-03-09 06:22:09,928 INFO L125 PetriNetUnfolderBase]: For 2225/2225 co-relation queries the response was YES. [2025-03-09 06:22:09,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7757 conditions, 3100 events. 1383/3100 cut-off events. For 2225/2225 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 20455 event pairs, 223 based on Foata normal form. 60/2897 useless extension candidates. Maximal degree in co-relation 6511. Up to 1838 conditions per place. [2025-03-09 06:22:09,945 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 87 selfloop transitions, 8 changer transitions 3/121 dead transitions. [2025-03-09 06:22:09,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 121 transitions, 754 flow [2025-03-09 06:22:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:22:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:22:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2025-03-09 06:22:09,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5737704918032787 [2025-03-09 06:22:09,946 INFO L175 Difference]: Start difference. First operand has 102 places, 91 transitions, 491 flow. Second operand 6 states and 210 transitions. [2025-03-09 06:22:09,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 121 transitions, 754 flow [2025-03-09 06:22:09,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 121 transitions, 696 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-03-09 06:22:09,954 INFO L231 Difference]: Finished difference. Result has 100 places, 90 transitions, 445 flow [2025-03-09 06:22:09,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=445, PETRI_PLACES=100, PETRI_TRANSITIONS=90} [2025-03-09 06:22:09,954 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 43 predicate places. [2025-03-09 06:22:09,955 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 90 transitions, 445 flow [2025-03-09 06:22:09,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 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-09 06:22:09,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:09,955 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:09,965 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-09 06:22:10,155 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-09 06:22:10,156 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-09 06:22:10,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:10,156 INFO L85 PathProgramCache]: Analyzing trace with hash -584508882, now seen corresponding path program 1 times [2025-03-09 06:22:10,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:10,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870793028] [2025-03-09 06:22:10,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:10,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:10,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:22:10,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:22:10,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:10,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:12,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:12,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870793028] [2025-03-09 06:22:12,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870793028] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:22:12,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183009706] [2025-03-09 06:22:12,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:12,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:12,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:12,372 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-09 06:22:12,373 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-09 06:22:12,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:22:12,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:22:12,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:12,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:12,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 3405 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-09 06:22:12,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:22:12,784 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 35 treesize of output 9 [2025-03-09 06:22:12,825 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 06:22:12,834 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-09 06:22:12,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2025-03-09 06:22:12,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 06:22:12,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2025-03-09 06:22:12,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 13 [2025-03-09 06:22:12,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 13 [2025-03-09 06:22:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:12,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:22:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:13,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183009706] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:22:13,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:22:13,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2025-03-09 06:22:13,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201052868] [2025-03-09 06:22:13,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:22:13,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 06:22:13,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:13,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 06:22:13,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-03-09 06:22:13,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-09 06:22:13,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 445 flow. Second operand has 21 states, 21 states have (on average 25.095238095238095) internal successors, (527), 21 states have internal predecessors, (527), 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-09 06:22:13,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:13,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-09 06:22:13,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:16,312 INFO L124 PetriNetUnfolderBase]: 1565/3524 cut-off events. [2025-03-09 06:22:16,312 INFO L125 PetriNetUnfolderBase]: For 2462/2462 co-relation queries the response was YES. [2025-03-09 06:22:16,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8612 conditions, 3524 events. 1565/3524 cut-off events. For 2462/2462 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 23926 event pairs, 223 based on Foata normal form. 24/3300 useless extension candidates. Maximal degree in co-relation 7171. Up to 633 conditions per place. [2025-03-09 06:22:16,335 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 203 selfloop transitions, 38 changer transitions 3/264 dead transitions. [2025-03-09 06:22:16,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 264 transitions, 1395 flow [2025-03-09 06:22:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 06:22:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 06:22:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 714 transitions. [2025-03-09 06:22:16,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5573770491803278 [2025-03-09 06:22:16,337 INFO L175 Difference]: Start difference. First operand has 100 places, 90 transitions, 445 flow. Second operand 21 states and 714 transitions. [2025-03-09 06:22:16,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 264 transitions, 1395 flow [2025-03-09 06:22:16,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 264 transitions, 1390 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:22:16,349 INFO L231 Difference]: Finished difference. Result has 121 places, 96 transitions, 589 flow [2025-03-09 06:22:16,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=589, PETRI_PLACES=121, PETRI_TRANSITIONS=96} [2025-03-09 06:22:16,350 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 64 predicate places. [2025-03-09 06:22:16,350 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 96 transitions, 589 flow [2025-03-09 06:22:16,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 25.095238095238095) internal successors, (527), 21 states have internal predecessors, (527), 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-09 06:22:16,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:16,350 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:16,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:22:16,551 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-09 06:22:16,551 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-09 06:22:16,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:16,551 INFO L85 PathProgramCache]: Analyzing trace with hash -939933233, now seen corresponding path program 1 times [2025-03-09 06:22:16,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:16,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158389928] [2025-03-09 06:22:16,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:16,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:16,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:22:16,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:22:16,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:16,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:22:16,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:16,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158389928] [2025-03-09 06:22:16,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158389928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:16,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:16,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:22:16,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797917004] [2025-03-09 06:22:16,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:16,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:22:16,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:16,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:22:16,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:22:16,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-09 06:22:16,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 96 transitions, 589 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-09 06:22:16,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:16,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-09 06:22:16,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:17,708 INFO L124 PetriNetUnfolderBase]: 1520/3407 cut-off events. [2025-03-09 06:22:17,708 INFO L125 PetriNetUnfolderBase]: For 3863/3863 co-relation queries the response was YES. [2025-03-09 06:22:17,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8938 conditions, 3407 events. 1520/3407 cut-off events. For 3863/3863 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 22934 event pairs, 796 based on Foata normal form. 72/3287 useless extension candidates. Maximal degree in co-relation 8480. Up to 1591 conditions per place. [2025-03-09 06:22:17,724 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 71 selfloop transitions, 16 changer transitions 0/109 dead transitions. [2025-03-09 06:22:17,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 109 transitions, 791 flow [2025-03-09 06:22:17,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:22:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:22:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-03-09 06:22:17,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5778688524590164 [2025-03-09 06:22:17,725 INFO L175 Difference]: Start difference. First operand has 121 places, 96 transitions, 589 flow. Second operand 4 states and 141 transitions. [2025-03-09 06:22:17,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 109 transitions, 791 flow [2025-03-09 06:22:17,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 109 transitions, 729 flow, removed 6 selfloop flow, removed 13 redundant places. [2025-03-09 06:22:17,736 INFO L231 Difference]: Finished difference. Result has 110 places, 95 transitions, 555 flow [2025-03-09 06:22:17,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=555, PETRI_PLACES=110, PETRI_TRANSITIONS=95} [2025-03-09 06:22:17,736 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 53 predicate places. [2025-03-09 06:22:17,736 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 95 transitions, 555 flow [2025-03-09 06:22:17,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-09 06:22:17,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:17,737 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, 1] [2025-03-09 06:22:17,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:22:17,737 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-09 06:22:17,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:17,737 INFO L85 PathProgramCache]: Analyzing trace with hash -388108677, now seen corresponding path program 1 times [2025-03-09 06:22:17,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:17,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393941252] [2025-03-09 06:22:17,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:17,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:17,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 06:22:17,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 06:22:17,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:17,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:18,033 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-09 06:22:18,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:18,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393941252] [2025-03-09 06:22:18,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393941252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:22:18,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034319614] [2025-03-09 06:22:18,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:18,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:18,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:18,036 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-09 06:22:18,038 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-09 06:22:18,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 06:22:18,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 06:22:18,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:18,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:18,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 3426 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:22:18,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:22:18,426 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-09 06:22:18,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:22:18,454 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-09 06:22:18,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034319614] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:22:18,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:22:18,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 06:22:18,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148842322] [2025-03-09 06:22:18,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:22:18,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:22:18,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:18,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:22:18,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:22:18,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-09 06:22:18,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 95 transitions, 555 flow. Second operand has 10 states, 10 states have (on average 26.7) internal successors, (267), 10 states have internal predecessors, (267), 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-09 06:22:18,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:18,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-09 06:22:18,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:19,749 INFO L124 PetriNetUnfolderBase]: 1235/2780 cut-off events. [2025-03-09 06:22:19,749 INFO L125 PetriNetUnfolderBase]: For 3155/3155 co-relation queries the response was YES. [2025-03-09 06:22:19,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7487 conditions, 2780 events. 1235/2780 cut-off events. For 3155/3155 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 17576 event pairs, 508 based on Foata normal form. 36/2663 useless extension candidates. Maximal degree in co-relation 7029. Up to 1018 conditions per place. [2025-03-09 06:22:19,762 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 96 selfloop transitions, 11 changer transitions 0/129 dead transitions. [2025-03-09 06:22:19,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 129 transitions, 832 flow [2025-03-09 06:22:19,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:22:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:22:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 245 transitions. [2025-03-09 06:22:19,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5737704918032787 [2025-03-09 06:22:19,763 INFO L175 Difference]: Start difference. First operand has 110 places, 95 transitions, 555 flow. Second operand 7 states and 245 transitions. [2025-03-09 06:22:19,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 129 transitions, 832 flow [2025-03-09 06:22:19,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 129 transitions, 801 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:19,771 INFO L231 Difference]: Finished difference. Result has 116 places, 94 transitions, 544 flow [2025-03-09 06:22:19,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=544, PETRI_PLACES=116, PETRI_TRANSITIONS=94} [2025-03-09 06:22:19,772 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 59 predicate places. [2025-03-09 06:22:19,772 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 94 transitions, 544 flow [2025-03-09 06:22:19,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.7) internal successors, (267), 10 states have internal predecessors, (267), 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-09 06:22:19,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:19,772 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:19,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 06:22:19,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:19,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-09 06:22:19,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:19,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2146155288, now seen corresponding path program 1 times [2025-03-09 06:22:19,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:19,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144375290] [2025-03-09 06:22:19,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:19,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:20,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 06:22:20,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:22:20,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:20,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 06:22:22,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:22,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144375290] [2025-03-09 06:22:22,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144375290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:22:22,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323094429] [2025-03-09 06:22:22,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:22,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:22,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:22,088 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-09 06:22:22,089 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-09 06:22:22,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 06:22:22,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:22:22,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:22,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:22,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 3494 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-09 06:22:22,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:22:22,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-03-09 06:22:22,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-09 06:22:22,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-09 06:22:22,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-09 06:22:22,848 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2025-03-09 06:22:22,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2025-03-09 06:22:22,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-09 06:22:22,878 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 15 treesize of output 7 [2025-03-09 06:22:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 06:22:22,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:22:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 06:22:23,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323094429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:22:23,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:22:23,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2025-03-09 06:22:23,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286522971] [2025-03-09 06:22:23,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:22:23,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 06:22:23,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:23,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 06:22:23,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420