./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue_ok_longest.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:08:00,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:08:01,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:08:01,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:08:01,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:08:01,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:08:01,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:08:01,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:08:01,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:08:01,098 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:08:01,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:08:01,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:08:01,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:08:01,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:08:01,099 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:08:01,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:08:01,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:08:01,099 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:08:01,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:08:01,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:08:01,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:08:01,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:08:01,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:08:01,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:08:01,099 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:08:01,100 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:08:01,100 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:08:01,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:08:01,100 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:08:01,100 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:08:01,100 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:08:01,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:08:01,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:08:01,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:08:01,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:08:01,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:08:01,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:08:01,100 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:08:01,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:08:01,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:08:01,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:08:01,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:08:01,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:08:01,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:08:01,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:08:01,101 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2025-03-04 15:08:01,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:08:01,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:08:01,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:08:01,339 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:08:01,339 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:08:01,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok_longest.i [2025-03-04 15:08:02,516 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08118cf74/ef154bc9d83d4fc7abbe2f45c49750ef/FLAG4af1660f2 [2025-03-04 15:08:02,827 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:08:02,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longest.i [2025-03-04 15:08:02,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08118cf74/ef154bc9d83d4fc7abbe2f45c49750ef/FLAG4af1660f2 [2025-03-04 15:08:03,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08118cf74/ef154bc9d83d4fc7abbe2f45c49750ef [2025-03-04 15:08:03,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:08:03,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:08:03,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:08:03,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:08:03,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:08:03,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:08:03" (1/1) ... [2025-03-04 15:08:03,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a3954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:03, skipping insertion in model container [2025-03-04 15:08:03,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:08:03" (1/1) ... [2025-03-04 15:08:03,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:08:03,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:08:03,477 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:08:03,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:08:03,628 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:08:03,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:03 WrapperNode [2025-03-04 15:08:03,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:08:03,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:08:03,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:08:03,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:08:03,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:03" (1/1) ... [2025-03-04 15:08:03,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:03" (1/1) ... [2025-03-04 15:08:03,728 INFO L138 Inliner]: procedures = 274, calls = 1654, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1807 [2025-03-04 15:08:03,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:08:03,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:08:03,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:08:03,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:08:03,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:03" (1/1) ... [2025-03-04 15:08:03,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:03" (1/1) ... [2025-03-04 15:08:03,752 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:03" (1/1) ... [2025-03-04 15:08:03,783 INFO L175 MemorySlicer]: Split 1635 memory accesses to 4 slices as follows [2, 5, 802, 826]. 51 percent of accesses are in the largest equivalence class. The 1610 initializations are split as follows [2, 5, 800, 803]. The 11 writes are split as follows [0, 0, 1, 10]. [2025-03-04 15:08:03,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:03" (1/1) ... [2025-03-04 15:08:03,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:03" (1/1) ... [2025-03-04 15:08:03,846 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:03" (1/1) ... [2025-03-04 15:08:03,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:03" (1/1) ... [2025-03-04 15:08:03,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:03" (1/1) ... [2025-03-04 15:08:03,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:03" (1/1) ... [2025-03-04 15:08:03,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:08:03,861 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:08:03,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:08:03,862 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:08:03,862 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:03" (1/1) ... [2025-03-04 15:08:03,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:08:03,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:03,890 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:08:03,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:08:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 15:08:03,913 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 15:08:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 15:08:03,914 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 15:08:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:08:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:08:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:08:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:08:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:08:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:08:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:08:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:08:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:08:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:08:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:08:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:08:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:08:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:08:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:08:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:08:03,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:08:03,918 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:08:04,044 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:08:04,046 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:08:05,536 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:08:05,537 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:08:28,813 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:08:28,814 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:08:28,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:08:28 BoogieIcfgContainer [2025-03-04 15:08:28,814 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:08:28,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:08:28,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:08:28,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:08:28,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:08:03" (1/3) ... [2025-03-04 15:08:28,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6050dca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:08:28, skipping insertion in model container [2025-03-04 15:08:28,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:03" (2/3) ... [2025-03-04 15:08:28,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6050dca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:08:28, skipping insertion in model container [2025-03-04 15:08:28,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:08:28" (3/3) ... [2025-03-04 15:08:28,821 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2025-03-04 15:08:28,834 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:08:28,835 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok_longest.i that has 3 procedures, 55 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-03-04 15:08:28,835 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:08:28,926 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:08:28,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 61 transitions, 136 flow [2025-03-04 15:08:29,020 INFO L124 PetriNetUnfolderBase]: 7/59 cut-off events. [2025-03-04 15:08:29,023 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:08:29,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 59 events. 7/59 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 169 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2025-03-04 15:08:29,027 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 61 transitions, 136 flow [2025-03-04 15:08:29,030 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 57 transitions, 123 flow [2025-03-04 15:08:29,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:08:29,048 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;@7289ead4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:08:29,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-04 15:08:29,095 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:08:29,095 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-03-04 15:08:29,096 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:08:29,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:29,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:29,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-04 15:08:29,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:29,100 INFO L85 PathProgramCache]: Analyzing trace with hash 878084973, now seen corresponding path program 1 times [2025-03-04 15:08:29,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:29,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238884676] [2025-03-04 15:08:29,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:29,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:29,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:08:29,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:08:29,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:29,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:30,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:30,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238884676] [2025-03-04 15:08:30,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238884676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:30,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:30,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:30,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531954817] [2025-03-04 15:08:30,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:30,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:30,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:31,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:31,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:31,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-04 15:08:31,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:31,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:31,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-04 15:08:31,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:31,963 INFO L124 PetriNetUnfolderBase]: 1024/2065 cut-off events. [2025-03-04 15:08:31,963 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-04 15:08:31,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3716 conditions, 2065 events. 1024/2065 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13304 event pairs, 211 based on Foata normal form. 28/1697 useless extension candidates. Maximal degree in co-relation 3574. Up to 1033 conditions per place. [2025-03-04 15:08:31,984 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 73 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2025-03-04 15:08:31,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 99 transitions, 372 flow [2025-03-04 15:08:31,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:31,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2025-03-04 15:08:31,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7008196721311475 [2025-03-04 15:08:31,999 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 123 flow. Second operand 4 states and 171 transitions. [2025-03-04 15:08:31,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 99 transitions, 372 flow [2025-03-04 15:08:32,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 99 transitions, 363 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:32,008 INFO L231 Difference]: Finished difference. Result has 60 places, 61 transitions, 156 flow [2025-03-04 15:08:32,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=60, PETRI_TRANSITIONS=61} [2025-03-04 15:08:32,015 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2025-03-04 15:08:32,015 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 156 flow [2025-03-04 15:08:32,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:32,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:32,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:32,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:08:32,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-04 15:08:32,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:32,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1450834084, now seen corresponding path program 1 times [2025-03-04 15:08:32,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:32,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027083061] [2025-03-04 15:08:32,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:32,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:32,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:08:32,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:08:32,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:32,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:33,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:33,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027083061] [2025-03-04 15:08:33,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027083061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:33,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:33,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:33,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025821017] [2025-03-04 15:08:33,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:33,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:33,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:33,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:33,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:33,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-04 15:08:33,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:33,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:33,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-04 15:08:33,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:33,698 INFO L124 PetriNetUnfolderBase]: 1019/2078 cut-off events. [2025-03-04 15:08:33,698 INFO L125 PetriNetUnfolderBase]: For 429/433 co-relation queries the response was YES. [2025-03-04 15:08:33,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4044 conditions, 2078 events. 1019/2078 cut-off events. For 429/433 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13398 event pairs, 215 based on Foata normal form. 46/1828 useless extension candidates. Maximal degree in co-relation 2603. Up to 1122 conditions per place. [2025-03-04 15:08:33,709 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 81 selfloop transitions, 6 changer transitions 0/108 dead transitions. [2025-03-04 15:08:33,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 108 transitions, 435 flow [2025-03-04 15:08:33,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:08:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:08:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 204 transitions. [2025-03-04 15:08:33,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6688524590163935 [2025-03-04 15:08:33,711 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 156 flow. Second operand 5 states and 204 transitions. [2025-03-04 15:08:33,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 108 transitions, 435 flow [2025-03-04 15:08:33,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 108 transitions, 430 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:33,716 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 174 flow [2025-03-04 15:08:33,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2025-03-04 15:08:33,718 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2025-03-04 15:08:33,719 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 174 flow [2025-03-04 15:08:33,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:33,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:33,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:33,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:08:33,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-04 15:08:33,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:33,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1612696120, now seen corresponding path program 1 times [2025-03-04 15:08:33,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:33,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169947421] [2025-03-04 15:08:33,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:33,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:33,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:08:33,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:08:33,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:33,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:34,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:34,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:34,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169947421] [2025-03-04 15:08:34,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169947421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:34,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:34,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:34,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278191019] [2025-03-04 15:08:34,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:34,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:08:34,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:34,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:08:34,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:08:34,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-04 15:08:34,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:34,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:34,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-04 15:08:34,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:36,260 INFO L124 PetriNetUnfolderBase]: 1147/2320 cut-off events. [2025-03-04 15:08:36,261 INFO L125 PetriNetUnfolderBase]: For 539/547 co-relation queries the response was YES. [2025-03-04 15:08:36,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4598 conditions, 2320 events. 1147/2320 cut-off events. For 539/547 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14862 event pairs, 209 based on Foata normal form. 50/2028 useless extension candidates. Maximal degree in co-relation 3108. Up to 1202 conditions per place. [2025-03-04 15:08:36,271 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 108 selfloop transitions, 11 changer transitions 0/140 dead transitions. [2025-03-04 15:08:36,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 140 transitions, 589 flow [2025-03-04 15:08:36,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:08:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:08:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 283 transitions. [2025-03-04 15:08:36,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6627634660421545 [2025-03-04 15:08:36,273 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 174 flow. Second operand 7 states and 283 transitions. [2025-03-04 15:08:36,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 140 transitions, 589 flow [2025-03-04 15:08:36,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 140 transitions, 576 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:36,277 INFO L231 Difference]: Finished difference. Result has 70 places, 68 transitions, 230 flow [2025-03-04 15:08:36,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=230, PETRI_PLACES=70, PETRI_TRANSITIONS=68} [2025-03-04 15:08:36,278 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2025-03-04 15:08:36,278 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 230 flow [2025-03-04 15:08:36,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:36,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:36,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:36,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:08:36,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-04 15:08:36,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:36,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1140833261, now seen corresponding path program 1 times [2025-03-04 15:08:36,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:36,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972502168] [2025-03-04 15:08:36,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:36,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:36,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:08:36,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:08:36,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:36,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:36,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:36,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972502168] [2025-03-04 15:08:36,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972502168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:36,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:36,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:36,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271298286] [2025-03-04 15:08:36,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:36,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:36,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:36,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:36,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:36,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 61 [2025-03-04 15:08:36,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:36,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:36,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 61 [2025-03-04 15:08:36,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:36,977 INFO L124 PetriNetUnfolderBase]: 515/1161 cut-off events. [2025-03-04 15:08:36,978 INFO L125 PetriNetUnfolderBase]: For 370/370 co-relation queries the response was YES. [2025-03-04 15:08:36,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2431 conditions, 1161 events. 515/1161 cut-off events. For 370/370 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6804 event pairs, 296 based on Foata normal form. 29/1084 useless extension candidates. Maximal degree in co-relation 2349. Up to 510 conditions per place. [2025-03-04 15:08:36,984 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 42 selfloop transitions, 2 changer transitions 6/73 dead transitions. [2025-03-04 15:08:36,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 317 flow [2025-03-04 15:08:36,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:36,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-03-04 15:08:36,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6557377049180327 [2025-03-04 15:08:36,987 INFO L175 Difference]: Start difference. First operand has 70 places, 68 transitions, 230 flow. Second operand 3 states and 120 transitions. [2025-03-04 15:08:36,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 317 flow [2025-03-04 15:08:36,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 73 transitions, 300 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 15:08:36,991 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 183 flow [2025-03-04 15:08:36,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2025-03-04 15:08:36,994 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2025-03-04 15:08:36,995 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 183 flow [2025-03-04 15:08:36,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:36,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:36,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:36,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:08:36,995 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-04 15:08:36,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:36,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1546030545, now seen corresponding path program 1 times [2025-03-04 15:08:36,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:36,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097399029] [2025-03-04 15:08:36,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:36,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:37,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:08:37,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:08:37,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:37,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:37,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:37,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097399029] [2025-03-04 15:08:37,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097399029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:37,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:37,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:37,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752352752] [2025-03-04 15:08:37,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:37,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:37,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:37,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:37,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:37,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-04 15:08:37,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:37,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:37,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-04 15:08:37,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:38,446 INFO L124 PetriNetUnfolderBase]: 440/978 cut-off events. [2025-03-04 15:08:38,447 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-04 15:08:38,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 978 events. 440/978 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5184 event pairs, 293 based on Foata normal form. 24/931 useless extension candidates. Maximal degree in co-relation 1867. Up to 591 conditions per place. [2025-03-04 15:08:38,452 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 53 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-03-04 15:08:38,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 77 transitions, 325 flow [2025-03-04 15:08:38,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2025-03-04 15:08:38,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6188524590163934 [2025-03-04 15:08:38,455 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 183 flow. Second operand 4 states and 151 transitions. [2025-03-04 15:08:38,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 77 transitions, 325 flow [2025-03-04 15:08:38,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 77 transitions, 319 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:38,461 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 195 flow [2025-03-04 15:08:38,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2025-03-04 15:08:38,462 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2025-03-04 15:08:38,462 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 195 flow [2025-03-04 15:08:38,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:38,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:38,462 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:38,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:08:38,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-04 15:08:38,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:38,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1429632689, now seen corresponding path program 1 times [2025-03-04 15:08:38,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:38,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121600362] [2025-03-04 15:08:38,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:38,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:38,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:08:38,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:08:38,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:38,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:39,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:39,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:39,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121600362] [2025-03-04 15:08:39,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121600362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:39,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:39,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:08:39,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616854476] [2025-03-04 15:08:39,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:39,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:08:39,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:39,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:08:39,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:08:39,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 61 [2025-03-04 15:08:39,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 63 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:39,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:39,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 61 [2025-03-04 15:08:39,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:40,310 INFO L124 PetriNetUnfolderBase]: 398/936 cut-off events. [2025-03-04 15:08:40,310 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2025-03-04 15:08:40,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 936 events. 398/936 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5002 event pairs, 118 based on Foata normal form. 12/895 useless extension candidates. Maximal degree in co-relation 1451. Up to 457 conditions per place. [2025-03-04 15:08:40,315 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 55 selfloop transitions, 5 changer transitions 3/86 dead transitions. [2025-03-04 15:08:40,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 86 transitions, 371 flow [2025-03-04 15:08:40,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:08:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:08:40,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2025-03-04 15:08:40,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6131147540983607 [2025-03-04 15:08:40,317 INFO L175 Difference]: Start difference. First operand has 70 places, 63 transitions, 195 flow. Second operand 5 states and 187 transitions. [2025-03-04 15:08:40,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 86 transitions, 371 flow [2025-03-04 15:08:40,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 86 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:40,320 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 198 flow [2025-03-04 15:08:40,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2025-03-04 15:08:40,323 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2025-03-04 15:08:40,323 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 198 flow [2025-03-04 15:08:40,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:40,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:40,324 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:40,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:08:40,324 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-04 15:08:40,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:40,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1073174039, now seen corresponding path program 1 times [2025-03-04 15:08:40,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:40,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720357634] [2025-03-04 15:08:40,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:40,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:40,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:08:40,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:08:40,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:40,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:41,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:41,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:41,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720357634] [2025-03-04 15:08:41,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720357634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:41,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050282592] [2025-03-04 15:08:41,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:41,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:41,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:41,467 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:41,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:08:41,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:08:41,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:08:41,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:41,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:41,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 3391 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 15:08:41,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:41,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 15:08:42,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-04 15:08:42,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-03-04 15:08:42,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:08:42,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2025-03-04 15:08:42,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:42,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:42,334 INFO L349 Elim1Store]: treesize reduction 47, result has 53.5 percent of original size [2025-03-04 15:08:42,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 184 [2025-03-04 15:08:42,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:08:42,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 140 [2025-03-04 15:08:42,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2025-03-04 15:08:42,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:08:42,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 184 [2025-03-04 15:08:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:42,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050282592] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:42,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:42,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-04 15:08:42,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129529682] [2025-03-04 15:08:42,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:42,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 15:08:42,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:42,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:08:42,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:08:42,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-03-04 15:08:42,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 198 flow. Second operand has 16 states, 16 states have (on average 24.1875) internal successors, (387), 16 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:42,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:42,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-03-04 15:08:42,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:44,260 INFO L124 PetriNetUnfolderBase]: 482/1083 cut-off events. [2025-03-04 15:08:44,261 INFO L125 PetriNetUnfolderBase]: For 231/231 co-relation queries the response was YES. [2025-03-04 15:08:44,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2357 conditions, 1083 events. 482/1083 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5527 event pairs, 209 based on Foata normal form. 12/1017 useless extension candidates. Maximal degree in co-relation 1750. Up to 411 conditions per place. [2025-03-04 15:08:44,265 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 56 selfloop transitions, 8 changer transitions 0/84 dead transitions. [2025-03-04 15:08:44,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 84 transitions, 373 flow [2025-03-04 15:08:44,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:08:44,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:08:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2025-03-04 15:08:44,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5218579234972678 [2025-03-04 15:08:44,268 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 198 flow. Second operand 6 states and 191 transitions. [2025-03-04 15:08:44,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 84 transitions, 373 flow [2025-03-04 15:08:44,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 84 transitions, 363 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:08:44,271 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 210 flow [2025-03-04 15:08:44,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2025-03-04 15:08:44,273 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 17 predicate places. [2025-03-04 15:08:44,273 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 210 flow [2025-03-04 15:08:44,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 24.1875) internal successors, (387), 16 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:44,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:44,273 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:44,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:44,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:44,475 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-04 15:08:44,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:44,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1091346856, now seen corresponding path program 1 times [2025-03-04 15:08:44,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:44,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023811829] [2025-03-04 15:08:44,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:44,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:44,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:08:44,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:08:44,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:44,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:46,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:46,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023811829] [2025-03-04 15:08:46,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023811829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:46,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875925331] [2025-03-04 15:08:46,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:46,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:46,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:46,825 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:46,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:08:46,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:08:47,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:08:47,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:47,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:47,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 3392 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 15:08:47,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:47,268 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-04 15:08:47,330 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:08:47,350 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-04 15:08:47,350 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-04 15:08:47,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:08:47,415 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:08:47,418 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:08:47,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 27 [2025-03-04 15:08:47,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:08:47,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2025-03-04 15:08:47,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:08:47,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2025-03-04 15:08:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:47,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:47,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875925331] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:47,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:47,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-03-04 15:08:47,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135264179] [2025-03-04 15:08:47,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:47,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:08:47,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:47,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:08:47,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:08:48,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2025-03-04 15:08:48,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 210 flow. Second operand has 19 states, 19 states have (on average 23.0) internal successors, (437), 19 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:48,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:48,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2025-03-04 15:08:48,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:51,822 INFO L124 PetriNetUnfolderBase]: 849/1892 cut-off events. [2025-03-04 15:08:51,823 INFO L125 PetriNetUnfolderBase]: For 741/741 co-relation queries the response was YES. [2025-03-04 15:08:51,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4261 conditions, 1892 events. 849/1892 cut-off events. For 741/741 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 10861 event pairs, 143 based on Foata normal form. 24/1788 useless extension candidates. Maximal degree in co-relation 3407. Up to 565 conditions per place. [2025-03-04 15:08:51,833 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 137 selfloop transitions, 15 changer transitions 3/174 dead transitions. [2025-03-04 15:08:51,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 174 transitions, 825 flow [2025-03-04 15:08:51,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:08:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:08:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 429 transitions. [2025-03-04 15:08:51,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5409836065573771 [2025-03-04 15:08:51,836 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 210 flow. Second operand 13 states and 429 transitions. [2025-03-04 15:08:51,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 174 transitions, 825 flow [2025-03-04 15:08:51,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 174 transitions, 808 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:51,841 INFO L231 Difference]: Finished difference. Result has 88 places, 72 transitions, 308 flow [2025-03-04 15:08:51,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=308, PETRI_PLACES=88, PETRI_TRANSITIONS=72} [2025-03-04 15:08:51,842 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2025-03-04 15:08:51,844 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 72 transitions, 308 flow [2025-03-04 15:08:51,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 23.0) internal successors, (437), 19 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:51,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:51,845 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:51,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:52,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 15:08:52,049 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-04 15:08:52,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:52,049 INFO L85 PathProgramCache]: Analyzing trace with hash 812428748, now seen corresponding path program 1 times [2025-03-04 15:08:52,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:52,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702374688] [2025-03-04 15:08:52,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:52,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:52,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:08:52,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:08:52,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:52,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:53,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:53,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702374688] [2025-03-04 15:08:53,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702374688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:53,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528419827] [2025-03-04 15:08:53,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:53,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:53,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:53,754 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:53,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:08:53,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:08:54,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:08:54,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:54,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:54,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 3404 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 15:08:54,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:54,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2025-03-04 15:08:54,205 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:08:54,212 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-04 15:08:54,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2025-03-04 15:08:54,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 15:08:54,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 3 [2025-03-04 15:08:54,364 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-04 15:08:54,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 40 [2025-03-04 15:08:54,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 18 [2025-03-04 15:08:54,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-03-04 15:08:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:54,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:58,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528419827] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:58,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:58,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 20 [2025-03-04 15:08:58,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99388131] [2025-03-04 15:08:58,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:58,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 15:08:58,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:58,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 15:08:58,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=350, Unknown=1, NotChecked=0, Total=462 [2025-03-04 15:08:58,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-03-04 15:08:58,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 72 transitions, 308 flow. Second operand has 22 states, 22 states have (on average 24.136363636363637) internal successors, (531), 22 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:58,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:58,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-03-04 15:08:58,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:02,751 INFO L124 PetriNetUnfolderBase]: 1458/3239 cut-off events. [2025-03-04 15:09:02,751 INFO L125 PetriNetUnfolderBase]: For 1567/1567 co-relation queries the response was YES. [2025-03-04 15:09:02,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7709 conditions, 3239 events. 1458/3239 cut-off events. For 1567/1567 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 21406 event pairs, 203 based on Foata normal form. 36/3072 useless extension candidates. Maximal degree in co-relation 6381. Up to 633 conditions per place. [2025-03-04 15:09:02,766 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 173 selfloop transitions, 34 changer transitions 3/229 dead transitions. [2025-03-04 15:09:02,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 229 transitions, 1178 flow [2025-03-04 15:09:02,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:09:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 15:09:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 592 transitions. [2025-03-04 15:09:02,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5391621129326047 [2025-03-04 15:09:02,769 INFO L175 Difference]: Start difference. First operand has 88 places, 72 transitions, 308 flow. Second operand 18 states and 592 transitions. [2025-03-04 15:09:02,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 229 transitions, 1178 flow [2025-03-04 15:09:02,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 229 transitions, 1142 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-03-04 15:09:02,775 INFO L231 Difference]: Finished difference. Result has 102 places, 91 transitions, 491 flow [2025-03-04 15:09:02,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=491, PETRI_PLACES=102, PETRI_TRANSITIONS=91} [2025-03-04 15:09:02,775 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 45 predicate places. [2025-03-04 15:09:02,775 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 91 transitions, 491 flow [2025-03-04 15:09:02,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 24.136363636363637) internal successors, (531), 22 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:02,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:02,776 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:02,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 15:09:02,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:02,976 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-04 15:09:02,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:02,977 INFO L85 PathProgramCache]: Analyzing trace with hash -584509875, now seen corresponding path program 1 times [2025-03-04 15:09:02,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:02,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61110733] [2025-03-04 15:09:02,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:02,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:03,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:09:03,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:09:03,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:03,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:03,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:03,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61110733] [2025-03-04 15:09:03,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61110733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:03,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160796722] [2025-03-04 15:09:03,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:03,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:03,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:03,201 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:03,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:09:03,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:09:03,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:09:03,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:03,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:03,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 3415 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:09:03,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:03,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:09:03,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160796722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:03,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:09:03,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:09:03,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482708515] [2025-03-04 15:09:03,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:03,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:09:03,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:03,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:09:03,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:09:03,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-04 15:09:03,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 91 transitions, 491 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:03,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:03,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-04 15:09:03,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:05,550 INFO L124 PetriNetUnfolderBase]: 1383/3100 cut-off events. [2025-03-04 15:09:05,551 INFO L125 PetriNetUnfolderBase]: For 2225/2225 co-relation queries the response was YES. [2025-03-04 15:09:05,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7757 conditions, 3100 events. 1383/3100 cut-off events. For 2225/2225 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 20455 event pairs, 223 based on Foata normal form. 60/2897 useless extension candidates. Maximal degree in co-relation 6511. Up to 1838 conditions per place. [2025-03-04 15:09:05,580 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 87 selfloop transitions, 8 changer transitions 3/121 dead transitions. [2025-03-04 15:09:05,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 121 transitions, 754 flow [2025-03-04 15:09:05,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:09:05,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:09:05,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2025-03-04 15:09:05,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5737704918032787 [2025-03-04 15:09:05,586 INFO L175 Difference]: Start difference. First operand has 102 places, 91 transitions, 491 flow. Second operand 6 states and 210 transitions. [2025-03-04 15:09:05,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 121 transitions, 754 flow [2025-03-04 15:09:05,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 121 transitions, 696 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-03-04 15:09:05,594 INFO L231 Difference]: Finished difference. Result has 100 places, 90 transitions, 445 flow [2025-03-04 15:09:05,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=445, PETRI_PLACES=100, PETRI_TRANSITIONS=90} [2025-03-04 15:09:05,596 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 43 predicate places. [2025-03-04 15:09:05,596 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 90 transitions, 445 flow [2025-03-04 15:09:05,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:05,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:05,597 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:05,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:09:05,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:05,798 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-04 15:09:05,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:05,799 INFO L85 PathProgramCache]: Analyzing trace with hash -584508882, now seen corresponding path program 1 times [2025-03-04 15:09:05,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:05,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133498461] [2025-03-04 15:09:05,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:05,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:05,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:09:05,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:09:05,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:05,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:07,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:07,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133498461] [2025-03-04 15:09:07,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133498461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:07,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055224156] [2025-03-04 15:09:07,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:07,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:07,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:07,811 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:07,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:09:07,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:09:08,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:09:08,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:08,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:08,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 3405 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 15:09:08,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:08,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2025-03-04 15:09:08,232 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:09:08,242 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-04 15:09:08,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2025-03-04 15:09:08,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 15:09:08,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2025-03-04 15:09:08,362 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-04 15:09:08,389 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-04 15:09:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:08,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:09:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:08,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055224156] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:09:08,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:09:08,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2025-03-04 15:09:08,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86694409] [2025-03-04 15:09:08,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:09:08,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 15:09:08,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:08,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 15:09:08,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-03-04 15:09:08,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-04 15:09:08,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 445 flow. Second operand has 21 states, 21 states have (on average 25.095238095238095) internal successors, (527), 21 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:08,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:08,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-04 15:09:08,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:11,538 INFO L124 PetriNetUnfolderBase]: 1565/3524 cut-off events. [2025-03-04 15:09:11,538 INFO L125 PetriNetUnfolderBase]: For 2462/2462 co-relation queries the response was YES. [2025-03-04 15:09:11,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8612 conditions, 3524 events. 1565/3524 cut-off events. For 2462/2462 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 23926 event pairs, 223 based on Foata normal form. 24/3300 useless extension candidates. Maximal degree in co-relation 7171. Up to 633 conditions per place. [2025-03-04 15:09:11,555 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 203 selfloop transitions, 38 changer transitions 3/264 dead transitions. [2025-03-04 15:09:11,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 264 transitions, 1395 flow [2025-03-04 15:09:11,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:09:11,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 15:09:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 714 transitions. [2025-03-04 15:09:11,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5573770491803278 [2025-03-04 15:09:11,557 INFO L175 Difference]: Start difference. First operand has 100 places, 90 transitions, 445 flow. Second operand 21 states and 714 transitions. [2025-03-04 15:09:11,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 264 transitions, 1395 flow [2025-03-04 15:09:11,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 264 transitions, 1390 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:09:11,566 INFO L231 Difference]: Finished difference. Result has 121 places, 96 transitions, 589 flow [2025-03-04 15:09:11,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=589, PETRI_PLACES=121, PETRI_TRANSITIONS=96} [2025-03-04 15:09:11,567 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 64 predicate places. [2025-03-04 15:09:11,567 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 96 transitions, 589 flow [2025-03-04 15:09:11,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 25.095238095238095) internal successors, (527), 21 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:11,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:11,567 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:11,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:09:11,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 15:09:11,768 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-04 15:09:11,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:11,768 INFO L85 PathProgramCache]: Analyzing trace with hash -939933233, now seen corresponding path program 1 times [2025-03-04 15:09:11,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:11,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686266399] [2025-03-04 15:09:11,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:11,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:11,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:09:11,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:09:11,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:11,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:09:11,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:11,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686266399] [2025-03-04 15:09:11,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686266399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:11,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:11,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:09:11,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051602069] [2025-03-04 15:09:11,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:11,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:09:11,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:11,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:09:11,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:09:11,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-04 15:09:11,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 96 transitions, 589 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:11,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:11,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-04 15:09:11,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:12,963 INFO L124 PetriNetUnfolderBase]: 1520/3407 cut-off events. [2025-03-04 15:09:12,963 INFO L125 PetriNetUnfolderBase]: For 3863/3863 co-relation queries the response was YES. [2025-03-04 15:09:12,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8938 conditions, 3407 events. 1520/3407 cut-off events. For 3863/3863 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 22934 event pairs, 796 based on Foata normal form. 72/3287 useless extension candidates. Maximal degree in co-relation 8480. Up to 1591 conditions per place. [2025-03-04 15:09:12,981 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 71 selfloop transitions, 16 changer transitions 0/109 dead transitions. [2025-03-04 15:09:12,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 109 transitions, 791 flow [2025-03-04 15:09:12,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:09:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:09:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-03-04 15:09:12,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5778688524590164 [2025-03-04 15:09:12,983 INFO L175 Difference]: Start difference. First operand has 121 places, 96 transitions, 589 flow. Second operand 4 states and 141 transitions. [2025-03-04 15:09:12,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 109 transitions, 791 flow [2025-03-04 15:09:12,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 109 transitions, 729 flow, removed 6 selfloop flow, removed 13 redundant places. [2025-03-04 15:09:12,994 INFO L231 Difference]: Finished difference. Result has 110 places, 95 transitions, 555 flow [2025-03-04 15:09:12,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=555, PETRI_PLACES=110, PETRI_TRANSITIONS=95} [2025-03-04 15:09:12,994 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 53 predicate places. [2025-03-04 15:09:12,994 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 95 transitions, 555 flow [2025-03-04 15:09:12,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:12,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:12,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:12,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:09:12,995 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-04 15:09:12,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash -388108677, now seen corresponding path program 1 times [2025-03-04 15:09:12,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:12,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868940709] [2025-03-04 15:09:12,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:12,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:13,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:09:13,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:09:13,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:13,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:13,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:13,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868940709] [2025-03-04 15:09:13,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868940709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:13,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075918849] [2025-03-04 15:09:13,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:13,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:13,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:13,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:13,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:09:13,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:09:13,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:09:13,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:13,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:13,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 3426 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:09:13,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:13,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:09:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:13,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075918849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:09:13,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:09:13,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 15:09:13,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786090366] [2025-03-04 15:09:13,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:09:13,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:09:13,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:13,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:09:13,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:09:13,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-04 15:09:13,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 95 transitions, 555 flow. Second operand has 10 states, 10 states have (on average 26.7) internal successors, (267), 10 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:13,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:13,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-04 15:09:13,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:14,885 INFO L124 PetriNetUnfolderBase]: 1235/2780 cut-off events. [2025-03-04 15:09:14,885 INFO L125 PetriNetUnfolderBase]: For 3155/3155 co-relation queries the response was YES. [2025-03-04 15:09:14,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7487 conditions, 2780 events. 1235/2780 cut-off events. For 3155/3155 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 17576 event pairs, 508 based on Foata normal form. 36/2663 useless extension candidates. Maximal degree in co-relation 7029. Up to 1018 conditions per place. [2025-03-04 15:09:14,897 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 96 selfloop transitions, 11 changer transitions 0/129 dead transitions. [2025-03-04 15:09:14,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 129 transitions, 832 flow [2025-03-04 15:09:14,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:09:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:09:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 245 transitions. [2025-03-04 15:09:14,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5737704918032787 [2025-03-04 15:09:14,898 INFO L175 Difference]: Start difference. First operand has 110 places, 95 transitions, 555 flow. Second operand 7 states and 245 transitions. [2025-03-04 15:09:14,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 129 transitions, 832 flow [2025-03-04 15:09:14,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 129 transitions, 801 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:14,906 INFO L231 Difference]: Finished difference. Result has 116 places, 94 transitions, 544 flow [2025-03-04 15:09:14,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=544, PETRI_PLACES=116, PETRI_TRANSITIONS=94} [2025-03-04 15:09:14,906 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 59 predicate places. [2025-03-04 15:09:14,907 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 94 transitions, 544 flow [2025-03-04 15:09:14,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.7) internal successors, (267), 10 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:14,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:14,907 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:14,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:09:15,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:15,108 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-04 15:09:15,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:15,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2146155288, now seen corresponding path program 1 times [2025-03-04 15:09:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454256604] [2025-03-04 15:09:15,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:15,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:09:15,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:09:15,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:15,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:09:16,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:16,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454256604] [2025-03-04 15:09:16,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454256604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:16,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369718045] [2025-03-04 15:09:16,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:16,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:16,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:16,864 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:16,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:09:16,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:09:17,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:09:17,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:17,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:17,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 3494 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 15:09:17,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:17,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-03-04 15:09:17,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 15:09:17,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 15:09:17,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 15:09:17,722 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2025-03-04 15:09:17,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2025-03-04 15:09:17,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 15:09:17,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 15:09:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:09:17,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:09:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:09:18,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369718045] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:09:18,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:09:18,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2025-03-04 15:09:18,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250182184] [2025-03-04 15:09:18,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:09:18,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 15:09:18,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:18,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 15:09:18,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2025-03-04 15:09:22,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:09:22,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-03-04 15:09:22,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 94 transitions, 544 flow. Second operand has 21 states, 21 states have (on average 24.38095238095238) internal successors, (512), 21 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:22,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:22,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-03-04 15:09:22,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand