./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/queue_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_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 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:20:48,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:20:48,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:20:48,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:20:48,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:20:48,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:20:48,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:20:48,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:20:48,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:20:48,857 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:20:48,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:20:48,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:20:48,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:20:48,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:20:48,858 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:20:48,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:20:48,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:20:48,858 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:20:48,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:20:48,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:20:48,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:20:48,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:20:48,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:20:48,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:20:48,859 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:20:48,859 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:20:48,859 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:20:48,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:20:48,859 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:20:48,859 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:20:48,860 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:20:48,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:20:48,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:20:48,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:20:48,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:20:48,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:20:48,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:20:48,860 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:20:48,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:20:48,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:20:48,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:20:48,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:20:48,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:20:48,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:20:48,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:20:48,861 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 -> 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 [2025-03-09 06:20:49,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:20:49,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:20:49,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:20:49,063 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:20:49,064 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:20:49,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_longest.i [2025-03-09 06:20:50,178 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/739076be6/f9fce3d7b6d449ceb67ae90bbacbaf5b/FLAGa493b24ea [2025-03-09 06:20:50,428 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:20:50,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i [2025-03-09 06:20:50,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/739076be6/f9fce3d7b6d449ceb67ae90bbacbaf5b/FLAGa493b24ea [2025-03-09 06:20:50,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/739076be6/f9fce3d7b6d449ceb67ae90bbacbaf5b [2025-03-09 06:20:50,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:20:50,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:20:50,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:20:50,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:20:50,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:20:50,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:20:50" (1/1) ... [2025-03-09 06:20:50,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd28bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:50, skipping insertion in model container [2025-03-09 06:20:50,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:20:50" (1/1) ... [2025-03-09 06:20:50,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:20:50,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:20:50,840 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:20:50,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:20:50,985 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:20:50,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:50 WrapperNode [2025-03-09 06:20:50,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:20:50,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:20:50,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:20:50,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:20:50,991 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:20:50" (1/1) ... [2025-03-09 06:20:51,017 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:20:50" (1/1) ... [2025-03-09 06:20:51,082 INFO L138 Inliner]: procedures = 274, calls = 1659, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1858 [2025-03-09 06:20:51,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:20:51,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:20:51,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:20:51,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:20:51,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:50" (1/1) ... [2025-03-09 06:20:51,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:50" (1/1) ... [2025-03-09 06:20:51,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:50" (1/1) ... [2025-03-09 06:20:51,147 INFO L175 MemorySlicer]: Split 1644 memory accesses to 4 slices as follows [2, 5, 803, 834]. 51 percent of accesses are in the largest equivalence class. The 1610 initializations are split as follows [2, 5, 800, 803]. The 16 writes are split as follows [0, 0, 2, 14]. [2025-03-09 06:20:51,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:50" (1/1) ... [2025-03-09 06:20:51,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:50" (1/1) ... [2025-03-09 06:20:51,187 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:50" (1/1) ... [2025-03-09 06:20:51,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:50" (1/1) ... [2025-03-09 06:20:51,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:50" (1/1) ... [2025-03-09 06:20:51,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:50" (1/1) ... [2025-03-09 06:20:51,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:20:51,214 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:20:51,214 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:20:51,214 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:20:51,215 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:50" (1/1) ... [2025-03-09 06:20:51,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:20:51,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:20:51,241 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:20:51,250 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:20:51,265 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-09 06:20:51,266 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-09 06:20:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-09 06:20:51,266 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-09 06:20:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 06:20:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:20:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:20:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:20:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 06:20:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:20:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:20:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:20:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 06:20:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 06:20:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:20:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:20:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:20:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:20:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 06:20:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:20:51,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:20:51,269 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:20:51,382 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:20:51,383 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:20:52,827 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:20:52,828 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:21:14,735 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:21:14,736 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:21:14,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:21:14 BoogieIcfgContainer [2025-03-09 06:21:14,736 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:21:14,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:21:14,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:21:14,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:21:14,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:20:50" (1/3) ... [2025-03-09 06:21:14,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40edbb72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:21:14, skipping insertion in model container [2025-03-09 06:21:14,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:50" (2/3) ... [2025-03-09 06:21:14,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40edbb72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:21:14, skipping insertion in model container [2025-03-09 06:21:14,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:21:14" (3/3) ... [2025-03-09 06:21:14,743 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2025-03-09 06:21:14,755 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:21:14,757 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longest.i that has 3 procedures, 75 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-09 06:21:14,757 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:21:14,849 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 06:21:14,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 83 transitions, 180 flow [2025-03-09 06:21:14,966 INFO L124 PetriNetUnfolderBase]: 9/81 cut-off events. [2025-03-09 06:21:14,968 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 06:21:14,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 81 events. 9/81 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 210 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2025-03-09 06:21:14,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 83 transitions, 180 flow [2025-03-09 06:21:14,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 79 transitions, 167 flow [2025-03-09 06:21:14,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:21:14,998 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;@3f4e647c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:21:14,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-09 06:21:15,058 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:21:15,059 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-09 06:21:15,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:21:15,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:15,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:21:15,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:15,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:15,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1799127322, now seen corresponding path program 1 times [2025-03-09 06:21:15,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:15,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326998222] [2025-03-09 06:21:15,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:15,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:15,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:21:15,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:21:15,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:15,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:17,006 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:17,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:17,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326998222] [2025-03-09 06:21:17,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326998222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:17,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:17,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:21:17,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393921443] [2025-03-09 06:21:17,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:17,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:21:17,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:17,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:21:17,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:21:17,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-09 06:21:17,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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:17,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:17,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-09 06:21:17,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:17,786 INFO L124 PetriNetUnfolderBase]: 1236/2546 cut-off events. [2025-03-09 06:21:17,788 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-09 06:21:17,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4529 conditions, 2546 events. 1236/2546 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 15940 event pairs, 205 based on Foata normal form. 48/2217 useless extension candidates. Maximal degree in co-relation 4460. Up to 1613 conditions per place. [2025-03-09 06:21:17,823 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 73 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2025-03-09 06:21:17,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 109 transitions, 391 flow [2025-03-09 06:21:17,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:21:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:21:17,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2025-03-09 06:21:17,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6295180722891566 [2025-03-09 06:21:17,840 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 167 flow. Second operand 4 states and 209 transitions. [2025-03-09 06:21:17,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 109 transitions, 391 flow [2025-03-09 06:21:17,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 109 transitions, 384 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:21:17,849 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 202 flow [2025-03-09 06:21:17,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2025-03-09 06:21:17,855 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-03-09 06:21:17,855 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 202 flow [2025-03-09 06:21:17,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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:17,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:17,856 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:17,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:21:17,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:17,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:17,857 INFO L85 PathProgramCache]: Analyzing trace with hash 61631688, now seen corresponding path program 1 times [2025-03-09 06:21:17,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:17,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742039986] [2025-03-09 06:21:17,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:17,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:17,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:21:18,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:21:18,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:18,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:19,454 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:19,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:19,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742039986] [2025-03-09 06:21:19,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742039986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:19,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:19,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:21:19,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452591605] [2025-03-09 06:21:19,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:19,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:21:19,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:19,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:21:19,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:21:19,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-09 06:21:19,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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:19,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:19,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-09 06:21:19,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:20,223 INFO L124 PetriNetUnfolderBase]: 1242/2599 cut-off events. [2025-03-09 06:21:20,223 INFO L125 PetriNetUnfolderBase]: For 456/460 co-relation queries the response was YES. [2025-03-09 06:21:20,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4908 conditions, 2599 events. 1242/2599 cut-off events. For 456/460 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 16708 event pairs, 264 based on Foata normal form. 40/2317 useless extension candidates. Maximal degree in co-relation 4140. Up to 1757 conditions per place. [2025-03-09 06:21:20,239 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 81 selfloop transitions, 6 changer transitions 0/117 dead transitions. [2025-03-09 06:21:20,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 117 transitions, 456 flow [2025-03-09 06:21:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:21:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:21:20,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 249 transitions. [2025-03-09 06:21:20,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-09 06:21:20,241 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 202 flow. Second operand 5 states and 249 transitions. [2025-03-09 06:21:20,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 117 transitions, 456 flow [2025-03-09 06:21:20,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 450 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:21:20,244 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 219 flow [2025-03-09 06:21:20,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2025-03-09 06:21:20,245 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-03-09 06:21:20,245 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 219 flow [2025-03-09 06:21:20,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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:20,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:20,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:20,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:21:20,245 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:20,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:20,246 INFO L85 PathProgramCache]: Analyzing trace with hash -901365652, now seen corresponding path program 1 times [2025-03-09 06:21:20,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:20,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618040133] [2025-03-09 06:21:20,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:20,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:20,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:21:20,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:21:20,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:20,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:21,214 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:21,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:21,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618040133] [2025-03-09 06:21:21,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618040133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:21,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:21,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:21:21,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948039217] [2025-03-09 06:21:21,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:21,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:21:21,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:21,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:21:21,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:21:21,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-09 06:21:21,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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:21,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:21,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-09 06:21:21,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:21,971 INFO L124 PetriNetUnfolderBase]: 1322/2709 cut-off events. [2025-03-09 06:21:21,971 INFO L125 PetriNetUnfolderBase]: For 536/554 co-relation queries the response was YES. [2025-03-09 06:21:21,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5217 conditions, 2709 events. 1322/2709 cut-off events. For 536/554 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 17314 event pairs, 266 based on Foata normal form. 44/2399 useless extension candidates. Maximal degree in co-relation 4439. Up to 1803 conditions per place. [2025-03-09 06:21:21,988 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 102 selfloop transitions, 11 changer transitions 0/143 dead transitions. [2025-03-09 06:21:21,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 143 transitions, 585 flow [2025-03-09 06:21:21,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:21:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:21:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 340 transitions. [2025-03-09 06:21:21,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5851979345955249 [2025-03-09 06:21:21,992 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 219 flow. Second operand 7 states and 340 transitions. [2025-03-09 06:21:21,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 143 transitions, 585 flow [2025-03-09 06:21:21,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 143 transitions, 571 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-09 06:21:21,997 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 274 flow [2025-03-09 06:21:21,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=274, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2025-03-09 06:21:21,999 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2025-03-09 06:21:21,999 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 274 flow [2025-03-09 06:21:22,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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:22,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:22,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:22,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:21:22,000 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:22,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:22,000 INFO L85 PathProgramCache]: Analyzing trace with hash -974817973, now seen corresponding path program 1 times [2025-03-09 06:21:22,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:22,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69069041] [2025-03-09 06:21:22,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:22,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:22,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:21:22,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:21:22,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:22,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:22,270 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:22,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:22,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69069041] [2025-03-09 06:21:22,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69069041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:22,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:22,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:21:22,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695991417] [2025-03-09 06:21:22,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:22,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:21:22,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:22,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:21:22,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:21:22,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-03-09 06:21:22,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:22,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:22,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-03-09 06:21:22,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:22,909 INFO L124 PetriNetUnfolderBase]: 1023/2391 cut-off events. [2025-03-09 06:21:22,910 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2025-03-09 06:21:22,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4362 conditions, 2391 events. 1023/2391 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 14112 event pairs, 483 based on Foata normal form. 41/2131 useless extension candidates. Maximal degree in co-relation 4352. Up to 884 conditions per place. [2025-03-09 06:21:22,923 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 63 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-03-09 06:21:22,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 96 transitions, 370 flow [2025-03-09 06:21:22,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:21:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:21:22,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-03-09 06:21:22,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7028112449799196 [2025-03-09 06:21:22,925 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 274 flow. Second operand 3 states and 175 transitions. [2025-03-09 06:21:22,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 96 transitions, 370 flow [2025-03-09 06:21:22,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 96 transitions, 331 flow, removed 4 selfloop flow, removed 13 redundant places. [2025-03-09 06:21:22,931 INFO L231 Difference]: Finished difference. Result has 74 places, 75 transitions, 167 flow [2025-03-09 06:21:22,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2025-03-09 06:21:22,932 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -3 predicate places. [2025-03-09 06:21:22,933 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 167 flow [2025-03-09 06:21:22,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:22,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:22,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:22,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:21:22,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:22,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:22,934 INFO L85 PathProgramCache]: Analyzing trace with hash -497108210, now seen corresponding path program 1 times [2025-03-09 06:21:22,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:22,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565015669] [2025-03-09 06:21:22,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:22,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:22,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:21:22,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:21:22,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:22,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:23,146 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:23,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:23,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565015669] [2025-03-09 06:21:23,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565015669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:23,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:23,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:21:23,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751873845] [2025-03-09 06:21:23,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:23,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:21:23,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:23,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:21:23,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:21:23,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-03-09 06:21:23,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:23,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:23,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-03-09 06:21:23,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:24,378 INFO L124 PetriNetUnfolderBase]: 1890/4146 cut-off events. [2025-03-09 06:21:24,378 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-03-09 06:21:24,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7399 conditions, 4146 events. 1890/4146 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 26808 event pairs, 949 based on Foata normal form. 138/3773 useless extension candidates. Maximal degree in co-relation 7394. Up to 1977 conditions per place. [2025-03-09 06:21:24,398 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 112 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2025-03-09 06:21:24,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 143 transitions, 550 flow [2025-03-09 06:21:24,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:21:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:21:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2025-03-09 06:21:24,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7560240963855421 [2025-03-09 06:21:24,399 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 167 flow. Second operand 4 states and 251 transitions. [2025-03-09 06:21:24,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 143 transitions, 550 flow [2025-03-09 06:21:24,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 143 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:21:24,401 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 188 flow [2025-03-09 06:21:24,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2025-03-09 06:21:24,402 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 1 predicate places. [2025-03-09 06:21:24,402 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 188 flow [2025-03-09 06:21:24,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:24,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:24,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:24,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:21:24,402 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:24,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:24,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1493796370, now seen corresponding path program 1 times [2025-03-09 06:21:24,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:24,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627384390] [2025-03-09 06:21:24,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:24,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:24,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:21:24,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:21:24,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:24,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:25,348 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:25,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:25,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627384390] [2025-03-09 06:21:25,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627384390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:25,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:25,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:21:25,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449284301] [2025-03-09 06:21:25,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:25,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:21:25,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:25,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:21:25,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:21:25,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-03-09 06:21:25,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 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:25,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:25,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-03-09 06:21:25,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:26,459 INFO L124 PetriNetUnfolderBase]: 1715/3860 cut-off events. [2025-03-09 06:21:26,460 INFO L125 PetriNetUnfolderBase]: For 784/904 co-relation queries the response was YES. [2025-03-09 06:21:26,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7363 conditions, 3860 events. 1715/3860 cut-off events. For 784/904 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 25129 event pairs, 279 based on Foata normal form. 0/3418 useless extension candidates. Maximal degree in co-relation 7356. Up to 2409 conditions per place. [2025-03-09 06:21:26,484 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 74 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2025-03-09 06:21:26,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 109 transitions, 464 flow [2025-03-09 06:21:26,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:21:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:21:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 251 transitions. [2025-03-09 06:21:26,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6048192771084338 [2025-03-09 06:21:26,487 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 188 flow. Second operand 5 states and 251 transitions. [2025-03-09 06:21:26,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 109 transitions, 464 flow [2025-03-09 06:21:26,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 109 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:21:26,490 INFO L231 Difference]: Finished difference. Result has 81 places, 76 transitions, 194 flow [2025-03-09 06:21:26,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=81, PETRI_TRANSITIONS=76} [2025-03-09 06:21:26,492 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-03-09 06:21:26,492 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 76 transitions, 194 flow [2025-03-09 06:21:26,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 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:26,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:26,493 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:26,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:21:26,493 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:26,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:26,494 INFO L85 PathProgramCache]: Analyzing trace with hash -620759307, now seen corresponding path program 1 times [2025-03-09 06:21:26,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:26,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920672776] [2025-03-09 06:21:26,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:26,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:26,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:21:26,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:21:26,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:26,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:29,076 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:29,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:29,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920672776] [2025-03-09 06:21:29,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920672776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:29,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:29,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:21:29,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561396319] [2025-03-09 06:21:29,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:29,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:21:29,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:29,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:21:29,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:21:29,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 83 [2025-03-09 06:21:29,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 76 transitions, 194 flow. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 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:29,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:29,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 83 [2025-03-09 06:21:29,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:30,747 INFO L124 PetriNetUnfolderBase]: 2309/4807 cut-off events. [2025-03-09 06:21:30,747 INFO L125 PetriNetUnfolderBase]: For 919/1071 co-relation queries the response was YES. [2025-03-09 06:21:30,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9583 conditions, 4807 events. 2309/4807 cut-off events. For 919/1071 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 31382 event pairs, 444 based on Foata normal form. 22/4297 useless extension candidates. Maximal degree in co-relation 9576. Up to 2448 conditions per place. [2025-03-09 06:21:30,769 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 134 selfloop transitions, 8 changer transitions 0/168 dead transitions. [2025-03-09 06:21:30,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 168 transitions, 779 flow [2025-03-09 06:21:30,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:21:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 06:21:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 378 transitions. [2025-03-09 06:21:30,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5060240963855421 [2025-03-09 06:21:30,771 INFO L175 Difference]: Start difference. First operand has 81 places, 76 transitions, 194 flow. Second operand 9 states and 378 transitions. [2025-03-09 06:21:30,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 168 transitions, 779 flow [2025-03-09 06:21:30,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 168 transitions, 769 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 06:21:30,774 INFO L231 Difference]: Finished difference. Result has 88 places, 79 transitions, 221 flow [2025-03-09 06:21:30,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=221, PETRI_PLACES=88, PETRI_TRANSITIONS=79} [2025-03-09 06:21:30,775 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 11 predicate places. [2025-03-09 06:21:30,775 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 79 transitions, 221 flow [2025-03-09 06:21:30,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 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:30,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:30,775 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:30,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:21:30,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:30,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash 539096771, now seen corresponding path program 1 times [2025-03-09 06:21:30,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:30,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193482856] [2025-03-09 06:21:30,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:30,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:30,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:21:30,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:21:30,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:30,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:30,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:30,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193482856] [2025-03-09 06:21:30,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193482856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:30,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11463625] [2025-03-09 06:21:30,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:30,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:30,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:30,987 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:30,989 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:31,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:21:31,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:21:31,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:31,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:31,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 3362 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:21:31,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:31,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:21:31,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11463625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:31,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:21:31,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 06:21:31,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480676100] [2025-03-09 06:21:31,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:31,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:21:31,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:31,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:21:31,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:21:31,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-03-09 06:21:31,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 79 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 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:31,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:31,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-03-09 06:21:31,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:32,799 INFO L124 PetriNetUnfolderBase]: 1856/4012 cut-off events. [2025-03-09 06:21:32,799 INFO L125 PetriNetUnfolderBase]: For 876/946 co-relation queries the response was YES. [2025-03-09 06:21:32,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8206 conditions, 4012 events. 1856/4012 cut-off events. For 876/946 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 26186 event pairs, 96 based on Foata normal form. 83/3737 useless extension candidates. Maximal degree in co-relation 8197. Up to 1221 conditions per place. [2025-03-09 06:21:32,818 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 172 selfloop transitions, 5 changer transitions 0/206 dead transitions. [2025-03-09 06:21:32,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 206 transitions, 935 flow [2025-03-09 06:21:32,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:21:32,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:21:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 367 transitions. [2025-03-09 06:21:32,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7369477911646586 [2025-03-09 06:21:32,819 INFO L175 Difference]: Start difference. First operand has 88 places, 79 transitions, 221 flow. Second operand 6 states and 367 transitions. [2025-03-09 06:21:32,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 206 transitions, 935 flow [2025-03-09 06:21:32,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 206 transitions, 899 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 06:21:32,824 INFO L231 Difference]: Finished difference. Result has 88 places, 78 transitions, 219 flow [2025-03-09 06:21:32,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=88, PETRI_TRANSITIONS=78} [2025-03-09 06:21:32,827 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 11 predicate places. [2025-03-09 06:21:32,827 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 78 transitions, 219 flow [2025-03-09 06:21:32,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 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:32,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:32,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:32,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:21:33,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:33,028 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:33,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:33,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2063665484, now seen corresponding path program 1 times [2025-03-09 06:21:33,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:33,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379491906] [2025-03-09 06:21:33,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:33,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:33,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:21:33,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:21:33,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:33,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:35,368 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:35,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:35,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379491906] [2025-03-09 06:21:35,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379491906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:35,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:35,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:21:35,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498631738] [2025-03-09 06:21:35,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:35,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:21:35,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:35,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:21:35,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:21:35,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 83 [2025-03-09 06:21:35,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 78 transitions, 219 flow. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 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,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:35,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 83 [2025-03-09 06:21:35,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:37,676 INFO L124 PetriNetUnfolderBase]: 2277/4742 cut-off events. [2025-03-09 06:21:37,677 INFO L125 PetriNetUnfolderBase]: For 2231/2303 co-relation queries the response was YES. [2025-03-09 06:21:37,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10226 conditions, 4742 events. 2277/4742 cut-off events. For 2231/2303 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 30937 event pairs, 444 based on Foata normal form. 22/4310 useless extension candidates. Maximal degree in co-relation 10216. Up to 2448 conditions per place. [2025-03-09 06:21:37,697 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 133 selfloop transitions, 8 changer transitions 0/166 dead transitions. [2025-03-09 06:21:37,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 166 transitions, 862 flow [2025-03-09 06:21:37,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:21:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 06:21:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 377 transitions. [2025-03-09 06:21:37,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5046854082998661 [2025-03-09 06:21:37,699 INFO L175 Difference]: Start difference. First operand has 88 places, 78 transitions, 219 flow. Second operand 9 states and 377 transitions. [2025-03-09 06:21:37,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 166 transitions, 862 flow [2025-03-09 06:21:37,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 166 transitions, 819 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 06:21:37,704 INFO L231 Difference]: Finished difference. Result has 92 places, 77 transitions, 223 flow [2025-03-09 06:21:37,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=223, PETRI_PLACES=92, PETRI_TRANSITIONS=77} [2025-03-09 06:21:37,704 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 15 predicate places. [2025-03-09 06:21:37,704 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 77 transitions, 223 flow [2025-03-09 06:21:37,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 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,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:37,705 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:37,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:21:37,705 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:37,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:37,705 INFO L85 PathProgramCache]: Analyzing trace with hash -467865400, now seen corresponding path program 1 times [2025-03-09 06:21:37,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:37,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358197204] [2025-03-09 06:21:37,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:37,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:37,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:21:37,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:21:37,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:37,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:21:37,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:37,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358197204] [2025-03-09 06:21:37,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358197204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:37,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:37,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:21:37,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055224156] [2025-03-09 06:21:37,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:37,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:21:37,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:37,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:21:37,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:21:37,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2025-03-09 06:21:37,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 77 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:37,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:37,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2025-03-09 06:21:37,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:39,321 INFO L124 PetriNetUnfolderBase]: 1994/4202 cut-off events. [2025-03-09 06:21:39,321 INFO L125 PetriNetUnfolderBase]: For 1395/1439 co-relation queries the response was YES. [2025-03-09 06:21:39,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8887 conditions, 4202 events. 1994/4202 cut-off events. For 1395/1439 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 27053 event pairs, 368 based on Foata normal form. 83/3972 useless extension candidates. Maximal degree in co-relation 8877. Up to 1995 conditions per place. [2025-03-09 06:21:39,337 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 98 selfloop transitions, 6 changer transitions 6/137 dead transitions. [2025-03-09 06:21:39,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 137 transitions, 621 flow [2025-03-09 06:21:39,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:21:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:21:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2025-03-09 06:21:39,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6987951807228916 [2025-03-09 06:21:39,339 INFO L175 Difference]: Start difference. First operand has 92 places, 77 transitions, 223 flow. Second operand 4 states and 232 transitions. [2025-03-09 06:21:39,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 137 transitions, 621 flow [2025-03-09 06:21:39,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 137 transitions, 583 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-09 06:21:39,344 INFO L231 Difference]: Finished difference. Result has 88 places, 75 transitions, 219 flow [2025-03-09 06:21:39,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2025-03-09 06:21:39,345 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 11 predicate places. [2025-03-09 06:21:39,346 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 219 flow [2025-03-09 06:21:39,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:39,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:39,347 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:39,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 06:21:39,347 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:39,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:39,347 INFO L85 PathProgramCache]: Analyzing trace with hash 450852536, now seen corresponding path program 1 times [2025-03-09 06:21:39,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:39,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076939830] [2025-03-09 06:21:39,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:39,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:39,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:21:39,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:21:39,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:39,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:39,523 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:39,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:39,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076939830] [2025-03-09 06:21:39,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076939830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:39,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:39,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:21:39,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437544273] [2025-03-09 06:21:39,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:39,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:21:39,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:39,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:21:39,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:21:39,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-09 06:21:39,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 75 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:39,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:39,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-09 06:21:39,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:41,015 INFO L124 PetriNetUnfolderBase]: 2829/5822 cut-off events. [2025-03-09 06:21:41,015 INFO L125 PetriNetUnfolderBase]: For 3575/3585 co-relation queries the response was YES. [2025-03-09 06:21:41,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12970 conditions, 5822 events. 2829/5822 cut-off events. For 3575/3585 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 40006 event pairs, 1541 based on Foata normal form. 144/5580 useless extension candidates. Maximal degree in co-relation 12960. Up to 3623 conditions per place. [2025-03-09 06:21:41,040 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 92 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2025-03-09 06:21:41,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 120 transitions, 577 flow [2025-03-09 06:21:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:21:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:21:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2025-03-09 06:21:41,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6596385542168675 [2025-03-09 06:21:41,042 INFO L175 Difference]: Start difference. First operand has 88 places, 75 transitions, 219 flow. Second operand 4 states and 219 transitions. [2025-03-09 06:21:41,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 120 transitions, 577 flow [2025-03-09 06:21:41,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 120 transitions, 555 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:21:41,047 INFO L231 Difference]: Finished difference. Result has 90 places, 77 transitions, 239 flow [2025-03-09 06:21:41,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=90, PETRI_TRANSITIONS=77} [2025-03-09 06:21:41,048 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2025-03-09 06:21:41,048 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 239 flow [2025-03-09 06:21:41,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:41,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:41,048 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:41,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 06:21:41,048 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:41,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:41,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1092485882, now seen corresponding path program 1 times [2025-03-09 06:21:41,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:41,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427191810] [2025-03-09 06:21:41,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:41,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:41,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 06:21:41,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 06:21:41,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:41,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:42,393 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:42,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:42,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427191810] [2025-03-09 06:21:42,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427191810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:42,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:42,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:21:42,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008204967] [2025-03-09 06:21:42,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:42,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:21:42,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:42,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:21:42,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:21:42,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-09 06:21:42,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 77 transitions, 239 flow. Second operand has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:42,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:42,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-09 06:21:42,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:44,407 INFO L124 PetriNetUnfolderBase]: 2804/5886 cut-off events. [2025-03-09 06:21:44,407 INFO L125 PetriNetUnfolderBase]: For 2552/2618 co-relation queries the response was YES. [2025-03-09 06:21:44,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13374 conditions, 5886 events. 2804/5886 cut-off events. For 2552/2618 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 41143 event pairs, 518 based on Foata normal form. 44/5604 useless extension candidates. Maximal degree in co-relation 13361. Up to 2804 conditions per place. [2025-03-09 06:21:44,433 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 130 selfloop transitions, 13 changer transitions 2/172 dead transitions. [2025-03-09 06:21:44,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 172 transitions, 898 flow [2025-03-09 06:21:44,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:21:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 06:21:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 414 transitions. [2025-03-09 06:21:44,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5542168674698795 [2025-03-09 06:21:44,435 INFO L175 Difference]: Start difference. First operand has 90 places, 77 transitions, 239 flow. Second operand 9 states and 414 transitions. [2025-03-09 06:21:44,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 172 transitions, 898 flow [2025-03-09 06:21:44,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 172 transitions, 895 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:21:44,440 INFO L231 Difference]: Finished difference. Result has 100 places, 83 transitions, 305 flow [2025-03-09 06:21:44,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=305, PETRI_PLACES=100, PETRI_TRANSITIONS=83} [2025-03-09 06:21:44,441 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 23 predicate places. [2025-03-09 06:21:44,441 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 83 transitions, 305 flow [2025-03-09 06:21:44,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:44,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:44,441 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:44,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:21:44,442 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:44,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:44,442 INFO L85 PathProgramCache]: Analyzing trace with hash -201680275, now seen corresponding path program 1 times [2025-03-09 06:21:44,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:44,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519253852] [2025-03-09 06:21:44,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:44,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:44,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:21:44,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:21:44,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:44,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:44,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:44,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519253852] [2025-03-09 06:21:44,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519253852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:44,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955556868] [2025-03-09 06:21:44,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:44,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:44,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:44,662 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:44,663 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:44,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:21:45,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:21:45,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:45,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:45,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 3420 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:21:45,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:45,087 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:21:45,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955556868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:45,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:21:45,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-09 06:21:45,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600886526] [2025-03-09 06:21:45,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:45,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:21:45,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:45,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:21:45,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:21:45,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-03-09 06:21:45,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 83 transitions, 305 flow. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:45,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:45,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-03-09 06:21:45,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:46,137 INFO L124 PetriNetUnfolderBase]: 3091/6080 cut-off events. [2025-03-09 06:21:46,137 INFO L125 PetriNetUnfolderBase]: For 3539/3573 co-relation queries the response was YES. [2025-03-09 06:21:46,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15211 conditions, 6080 events. 3091/6080 cut-off events. For 3539/3573 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 40431 event pairs, 692 based on Foata normal form. 150/5984 useless extension candidates. Maximal degree in co-relation 15196. Up to 3347 conditions per place. [2025-03-09 06:21:46,167 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 80 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2025-03-09 06:21:46,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 109 transitions, 577 flow [2025-03-09 06:21:46,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:21:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:21:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2025-03-09 06:21:46,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5843373493975904 [2025-03-09 06:21:46,170 INFO L175 Difference]: Start difference. First operand has 100 places, 83 transitions, 305 flow. Second operand 4 states and 194 transitions. [2025-03-09 06:21:46,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 109 transitions, 577 flow [2025-03-09 06:21:46,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 109 transitions, 565 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 06:21:46,180 INFO L231 Difference]: Finished difference. Result has 96 places, 81 transitions, 295 flow [2025-03-09 06:21:46,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=96, PETRI_TRANSITIONS=81} [2025-03-09 06:21:46,181 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 19 predicate places. [2025-03-09 06:21:46,181 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 81 transitions, 295 flow [2025-03-09 06:21:46,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:46,181 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:46,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 06:21:46,382 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,SelfDestructingSolverStorable12 [2025-03-09 06:21:46,382 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:46,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:46,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1957117374, now seen corresponding path program 1 times [2025-03-09 06:21:46,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:46,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537110924] [2025-03-09 06:21:46,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:46,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:46,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:21:46,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:21:46,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:46,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:21:46,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:46,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537110924] [2025-03-09 06:21:46,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537110924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:46,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:46,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:21:46,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144708148] [2025-03-09 06:21:46,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:46,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:21:46,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:46,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:21:46,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:21:46,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-03-09 06:21:46,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 81 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:46,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:46,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-03-09 06:21:46,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:47,693 INFO L124 PetriNetUnfolderBase]: 2735/5614 cut-off events. [2025-03-09 06:21:47,693 INFO L125 PetriNetUnfolderBase]: For 3806/3826 co-relation queries the response was YES. [2025-03-09 06:21:47,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14049 conditions, 5614 events. 2735/5614 cut-off events. For 3806/3826 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 37809 event pairs, 736 based on Foata normal form. 150/5624 useless extension candidates. Maximal degree in co-relation 14033. Up to 2824 conditions per place. [2025-03-09 06:21:47,718 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 84 selfloop transitions, 6 changer transitions 0/114 dead transitions. [2025-03-09 06:21:47,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 114 transitions, 599 flow [2025-03-09 06:21:47,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:21:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:21:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-03-09 06:21:47,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5993975903614458 [2025-03-09 06:21:47,719 INFO L175 Difference]: Start difference. First operand has 96 places, 81 transitions, 295 flow. Second operand 4 states and 199 transitions. [2025-03-09 06:21:47,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 114 transitions, 599 flow [2025-03-09 06:21:47,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 114 transitions, 589 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:21:47,728 INFO L231 Difference]: Finished difference. Result has 95 places, 80 transitions, 297 flow [2025-03-09 06:21:47,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=297, PETRI_PLACES=95, PETRI_TRANSITIONS=80} [2025-03-09 06:21:47,728 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 18 predicate places. [2025-03-09 06:21:47,728 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 80 transitions, 297 flow [2025-03-09 06:21:47,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:47,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:47,729 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:47,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 06:21:47,729 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:47,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:47,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1051864243, now seen corresponding path program 1 times [2025-03-09 06:21:47,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:47,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297944882] [2025-03-09 06:21:47,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:47,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:47,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 06:21:47,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 06:21:47,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:47,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:47,960 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:47,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:47,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297944882] [2025-03-09 06:21:47,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297944882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:47,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:47,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:21:47,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321645584] [2025-03-09 06:21:47,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:47,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:21:47,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:47,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:21:47,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:21:47,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-03-09 06:21:47,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 80 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:47,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:47,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-03-09 06:21:47,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:48,878 INFO L124 PetriNetUnfolderBase]: 1726/3931 cut-off events. [2025-03-09 06:21:48,878 INFO L125 PetriNetUnfolderBase]: For 3708/3708 co-relation queries the response was YES. [2025-03-09 06:21:48,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10196 conditions, 3931 events. 1726/3931 cut-off events. For 3708/3708 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 25743 event pairs, 514 based on Foata normal form. 166/4019 useless extension candidates. Maximal degree in co-relation 10180. Up to 1934 conditions per place. [2025-03-09 06:21:48,894 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 63 selfloop transitions, 6 changer transitions 0/95 dead transitions. [2025-03-09 06:21:48,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 95 transitions, 508 flow [2025-03-09 06:21:48,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:21:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:21:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-03-09 06:21:48,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6626506024096386 [2025-03-09 06:21:48,895 INFO L175 Difference]: Start difference. First operand has 95 places, 80 transitions, 297 flow. Second operand 3 states and 165 transitions. [2025-03-09 06:21:48,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 95 transitions, 508 flow [2025-03-09 06:21:48,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 95 transitions, 489 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 06:21:48,902 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 285 flow [2025-03-09 06:21:48,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2025-03-09 06:21:48,902 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 18 predicate places. [2025-03-09 06:21:48,902 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 285 flow [2025-03-09 06:21:48,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:48,902 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:48,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 06:21:48,902 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:48,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:48,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1185366115, now seen corresponding path program 1 times [2025-03-09 06:21:48,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:48,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145938344] [2025-03-09 06:21:48,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:48,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:48,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 06:21:49,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 06:21:49,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:49,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:50,403 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:50,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:50,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145938344] [2025-03-09 06:21:50,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145938344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:50,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:50,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 06:21:50,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827788475] [2025-03-09 06:21:50,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:50,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:21:50,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:50,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:21:50,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:21:50,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-09 06:21:50,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 285 flow. Second operand has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 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:50,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:50,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-09 06:21:50,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:52,171 INFO L124 PetriNetUnfolderBase]: 1760/3872 cut-off events. [2025-03-09 06:21:52,171 INFO L125 PetriNetUnfolderBase]: For 3198/3200 co-relation queries the response was YES. [2025-03-09 06:21:52,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10280 conditions, 3872 events. 1760/3872 cut-off events. For 3198/3200 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 24395 event pairs, 300 based on Foata normal form. 36/3786 useless extension candidates. Maximal degree in co-relation 10263. Up to 1708 conditions per place. [2025-03-09 06:21:52,186 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 115 selfloop transitions, 11 changer transitions 2/152 dead transitions. [2025-03-09 06:21:52,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 152 transitions, 877 flow [2025-03-09 06:21:52,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:21:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 06:21:52,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 396 transitions. [2025-03-09 06:21:52,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5301204819277109 [2025-03-09 06:21:52,187 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 285 flow. Second operand 9 states and 396 transitions. [2025-03-09 06:21:52,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 152 transitions, 877 flow [2025-03-09 06:21:52,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 152 transitions, 861 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:21:52,194 INFO L231 Difference]: Finished difference. Result has 101 places, 77 transitions, 293 flow [2025-03-09 06:21:52,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=293, PETRI_PLACES=101, PETRI_TRANSITIONS=77} [2025-03-09 06:21:52,194 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 24 predicate places. [2025-03-09 06:21:52,195 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 77 transitions, 293 flow [2025-03-09 06:21:52,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 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:52,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:52,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:52,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 06:21:52,195 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:52,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:52,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1661928178, now seen corresponding path program 1 times [2025-03-09 06:21:52,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:52,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295708780] [2025-03-09 06:21:52,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:52,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:52,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:21:52,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:21:52,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:52,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:57,283 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:57,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:57,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295708780] [2025-03-09 06:21:57,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295708780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:57,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:57,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 06:21:57,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183499892] [2025-03-09 06:21:57,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:57,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 06:21:57,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:57,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 06:21:57,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-09 06:21:57,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 83 [2025-03-09 06:21:57,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 77 transitions, 293 flow. Second operand has 11 states, 11 states have (on average 27.454545454545453) internal successors, (302), 11 states have internal predecessors, (302), 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:57,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:57,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 83 [2025-03-09 06:21:57,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:59,045 INFO L124 PetriNetUnfolderBase]: 2238/4704 cut-off events. [2025-03-09 06:21:59,045 INFO L125 PetriNetUnfolderBase]: For 4096/4096 co-relation queries the response was YES. [2025-03-09 06:21:59,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12611 conditions, 4704 events. 2238/4704 cut-off events. For 4096/4096 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 29474 event pairs, 229 based on Foata normal form. 0/4542 useless extension candidates. Maximal degree in co-relation 12593. Up to 1680 conditions per place. [2025-03-09 06:21:59,062 INFO L140 encePairwiseOnDemand]: 70/83 looper letters, 164 selfloop transitions, 14 changer transitions 2/199 dead transitions. [2025-03-09 06:21:59,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 199 transitions, 1182 flow [2025-03-09 06:21:59,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 06:21:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 06:21:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 476 transitions. [2025-03-09 06:21:59,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4411492122335496 [2025-03-09 06:21:59,064 INFO L175 Difference]: Start difference. First operand has 101 places, 77 transitions, 293 flow. Second operand 13 states and 476 transitions. [2025-03-09 06:21:59,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 199 transitions, 1182 flow [2025-03-09 06:21:59,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 199 transitions, 1166 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 06:21:59,070 INFO L231 Difference]: Finished difference. Result has 111 places, 82 transitions, 343 flow [2025-03-09 06:21:59,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=343, PETRI_PLACES=111, PETRI_TRANSITIONS=82} [2025-03-09 06:21:59,070 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 34 predicate places. [2025-03-09 06:21:59,071 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 82 transitions, 343 flow [2025-03-09 06:21:59,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.454545454545453) internal successors, (302), 11 states have internal predecessors, (302), 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:59,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:59,071 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:59,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 06:21:59,071 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:59,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:59,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1042892128, now seen corresponding path program 1 times [2025-03-09 06:21:59,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:59,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540567798] [2025-03-09 06:21:59,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:59,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:59,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:21:59,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:21:59,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:59,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:59,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:59,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540567798] [2025-03-09 06:21:59,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540567798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:59,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:59,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:21:59,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601798397] [2025-03-09 06:21:59,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:59,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:21:59,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:59,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:21:59,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:21:59,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-03-09 06:21:59,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 82 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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:59,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:59,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-03-09 06:21:59,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:59,852 INFO L124 PetriNetUnfolderBase]: 1680/3801 cut-off events. [2025-03-09 06:21:59,852 INFO L125 PetriNetUnfolderBase]: For 3935/3941 co-relation queries the response was YES. [2025-03-09 06:21:59,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10216 conditions, 3801 events. 1680/3801 cut-off events. For 3935/3941 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 23419 event pairs, 1011 based on Foata normal form. 30/3743 useless extension candidates. Maximal degree in co-relation 10195. Up to 1854 conditions per place. [2025-03-09 06:21:59,865 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 70 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2025-03-09 06:21:59,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 99 transitions, 557 flow [2025-03-09 06:21:59,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:21:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:21:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-03-09 06:21:59,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6626506024096386 [2025-03-09 06:21:59,866 INFO L175 Difference]: Start difference. First operand has 111 places, 82 transitions, 343 flow. Second operand 3 states and 165 transitions. [2025-03-09 06:21:59,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 99 transitions, 557 flow [2025-03-09 06:21:59,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 99 transitions, 540 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 06:21:59,872 INFO L231 Difference]: Finished difference. Result has 106 places, 80 transitions, 322 flow [2025-03-09 06:21:59,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=106, PETRI_TRANSITIONS=80} [2025-03-09 06:21:59,872 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 29 predicate places. [2025-03-09 06:21:59,872 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 80 transitions, 322 flow [2025-03-09 06:21:59,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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:59,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:59,873 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:59,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 06:21:59,873 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:59,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:59,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2114696839, now seen corresponding path program 1 times [2025-03-09 06:21:59,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:59,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878027895] [2025-03-09 06:21:59,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:59,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:59,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 06:21:59,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 06:21:59,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:59,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:00,522 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:22:00,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:00,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878027895] [2025-03-09 06:22:00,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878027895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:00,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:00,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:22:00,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155970219] [2025-03-09 06:22:00,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:00,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:22:00,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:00,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:22:00,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:22:00,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-03-09 06:22:00,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 80 transitions, 322 flow. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 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:00,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:00,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-03-09 06:22:00,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:01,547 INFO L124 PetriNetUnfolderBase]: 1676/3754 cut-off events. [2025-03-09 06:22:01,548 INFO L125 PetriNetUnfolderBase]: For 3546/3546 co-relation queries the response was YES. [2025-03-09 06:22:01,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10127 conditions, 3754 events. 1676/3754 cut-off events. For 3546/3546 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 23086 event pairs, 1059 based on Foata normal form. 35/3705 useless extension candidates. Maximal degree in co-relation 10104. Up to 2112 conditions per place. [2025-03-09 06:22:01,561 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 58 selfloop transitions, 12 changer transitions 0/95 dead transitions. [2025-03-09 06:22:01,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 95 transitions, 532 flow [2025-03-09 06:22:01,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:22:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:22:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2025-03-09 06:22:01,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5421686746987951 [2025-03-09 06:22:01,562 INFO L175 Difference]: Start difference. First operand has 106 places, 80 transitions, 322 flow. Second operand 5 states and 225 transitions. [2025-03-09 06:22:01,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 95 transitions, 532 flow [2025-03-09 06:22:01,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 95 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:01,568 INFO L231 Difference]: Finished difference. Result has 107 places, 79 transitions, 340 flow [2025-03-09 06:22:01,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=340, PETRI_PLACES=107, PETRI_TRANSITIONS=79} [2025-03-09 06:22:01,569 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 30 predicate places. [2025-03-09 06:22:01,569 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 79 transitions, 340 flow [2025-03-09 06:22:01,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 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:01,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:01,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:01,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 06:22:01,569 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:22:01,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:01,570 INFO L85 PathProgramCache]: Analyzing trace with hash 648176193, now seen corresponding path program 1 times [2025-03-09 06:22:01,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:01,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158873475] [2025-03-09 06:22:01,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:01,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:01,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 06:22:01,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 06:22:01,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:01,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:04,462 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:04,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:04,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158873475] [2025-03-09 06:22:04,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158873475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:22:04,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325003413] [2025-03-09 06:22:04,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:04,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:04,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:04,467 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:22:04,468 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:22:04,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 06:22:04,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 06:22:04,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:04,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:04,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 3508 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-09 06:22:04,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:22:04,981 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:22:05,025 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 06:22:05,041 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-09 06:22:05,042 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:22:05,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:22:05,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:22:05,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2025-03-09 06:22:05,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-03-09 06:22:05,197 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 06:22:05,214 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-09 06:22:05,214 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:22:05,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:22:05,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:22:05,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2025-03-09 06:22:05,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:22:05,319 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 38 treesize of output 16 [2025-03-09 06:22:05,372 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:05,378 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 19 treesize of output 7 [2025-03-09 06:22:05,390 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:05,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:22:06,244 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:06,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325003413] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:22:06,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:22:06,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 27 [2025-03-09 06:22:06,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193062053] [2025-03-09 06:22:06,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:22:06,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-09 06:22:06,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:06,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 06:22:06,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2025-03-09 06:22:06,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-03-09 06:22:06,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 79 transitions, 340 flow. Second operand has 29 states, 29 states have (on average 32.0) internal successors, (928), 29 states have internal predecessors, (928), 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:06,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:06,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-03-09 06:22:06,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand