./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/queue_ok.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.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 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:07:37,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:07:37,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:07:37,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:07:37,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:07:37,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:07:37,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:07:37,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:07:37,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:07:37,978 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:07:37,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:07:37,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:07:37,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:07:37,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:07:37,980 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:07:37,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:07:37,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:07:37,980 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:07:37,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:07:37,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:07:37,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:07:37,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:07:37,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:07:37,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:07:37,981 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:07:37,981 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:07:37,981 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:07:37,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:07:37,981 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:07:37,981 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:07:37,982 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:07:37,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:07:37,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:07:37,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:07:37,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:07:37,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:07:37,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:07:37,983 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:07:37,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:07:37,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:07:37,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:07:37,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:07:37,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:07:37,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:07:37,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:07:37,983 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2025-03-04 15:07:38,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:07:38,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:07:38,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:07:38,211 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:07:38,211 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:07:38,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok.i [2025-03-04 15:07:39,374 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00c13a214/5c180d263ef042d7a22bc54c6f32c686/FLAG141350d22 [2025-03-04 15:07:39,703 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:07:39,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok.i [2025-03-04 15:07:39,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00c13a214/5c180d263ef042d7a22bc54c6f32c686/FLAG141350d22 [2025-03-04 15:07:39,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00c13a214/5c180d263ef042d7a22bc54c6f32c686 [2025-03-04 15:07:39,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:07:39,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:07:39,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:07:39,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:07:39,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:07:39,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:07:39" (1/1) ... [2025-03-04 15:07:39,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71bc331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:39, skipping insertion in model container [2025-03-04 15:07:39,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:07:39" (1/1) ... [2025-03-04 15:07:40,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:07:40,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:07:40,336 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:07:40,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:07:40,437 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:07:40,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:40 WrapperNode [2025-03-04 15:07:40,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:07:40,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:07:40,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:07:40,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:07:40,446 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:07:40" (1/1) ... [2025-03-04 15:07:40,457 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:07:40" (1/1) ... [2025-03-04 15:07:40,484 INFO L138 Inliner]: procedures = 274, calls = 94, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 247 [2025-03-04 15:07:40,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:07:40,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:07:40,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:07:40,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:07:40,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:40" (1/1) ... [2025-03-04 15:07:40,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:40" (1/1) ... [2025-03-04 15:07:40,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:40" (1/1) ... [2025-03-04 15:07:40,512 INFO L175 MemorySlicer]: Split 75 memory accesses to 4 slices as follows [2, 5, 22, 46]. 61 percent of accesses are in the largest equivalence class. The 50 initializations are split as follows [2, 5, 20, 23]. The 11 writes are split as follows [0, 0, 1, 10]. [2025-03-04 15:07:40,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:40" (1/1) ... [2025-03-04 15:07:40,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:40" (1/1) ... [2025-03-04 15:07:40,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:40" (1/1) ... [2025-03-04 15:07:40,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:40" (1/1) ... [2025-03-04 15:07:40,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:40" (1/1) ... [2025-03-04 15:07:40,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:40" (1/1) ... [2025-03-04 15:07:40,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:07:40,528 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:07:40,529 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:07:40,529 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:07:40,529 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:40" (1/1) ... [2025-03-04 15:07:40,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:07:40,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:07:40,563 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:07:40,566 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:07:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 15:07:40,582 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 15:07:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 15:07:40,582 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 15:07:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:07:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:07:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:07:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:07:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:07:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:07:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:07:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:07:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:07:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:07:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:07:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:07:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:07:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:07:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:07:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:07:40,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:07:40,584 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:07:40,705 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:07:40,706 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:07:41,040 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:07:41,041 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:07:41,265 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:07:41,266 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:07:41,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:07:41 BoogieIcfgContainer [2025-03-04 15:07:41,267 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:07:41,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:07:41,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:07:41,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:07:41,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:07:39" (1/3) ... [2025-03-04 15:07:41,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc4f329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:07:41, skipping insertion in model container [2025-03-04 15:07:41,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:40" (2/3) ... [2025-03-04 15:07:41,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc4f329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:07:41, skipping insertion in model container [2025-03-04 15:07:41,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:07:41" (3/3) ... [2025-03-04 15:07:41,274 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2025-03-04 15:07:41,287 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:07:41,288 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok.i that has 3 procedures, 55 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-03-04 15:07:41,289 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:07:41,348 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:07:41,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 61 transitions, 136 flow [2025-03-04 15:07:41,410 INFO L124 PetriNetUnfolderBase]: 7/59 cut-off events. [2025-03-04 15:07:41,413 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:07:41,416 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:07:41,417 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 61 transitions, 136 flow [2025-03-04 15:07:41,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 57 transitions, 123 flow [2025-03-04 15:07:41,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:07:41,436 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;@44f90953, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:07:41,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-04 15:07:41,447 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:07:41,447 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-03-04 15:07:41,447 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:07:41,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:41,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:41,448 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:07:41,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:41,452 INFO L85 PathProgramCache]: Analyzing trace with hash -125211795, now seen corresponding path program 1 times [2025-03-04 15:07:41,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:41,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82936683] [2025-03-04 15:07:41,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:41,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:41,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:07:41,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:07:41,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:41,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:42,052 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:07:42,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:42,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82936683] [2025-03-04 15:07:42,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82936683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:42,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:42,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:07:42,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942125299] [2025-03-04 15:07:42,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:42,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:07:42,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:42,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:07:42,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:07:42,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-04 15:07:42,093 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:07:42,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:42,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-04 15:07:42,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:42,465 INFO L124 PetriNetUnfolderBase]: 1024/2065 cut-off events. [2025-03-04 15:07:42,469 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-04 15:07:42,473 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:07:42,483 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 73 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2025-03-04 15:07:42,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 99 transitions, 372 flow [2025-03-04 15:07:42,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:07:42,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:07:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2025-03-04 15:07:42,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7008196721311475 [2025-03-04 15:07:42,495 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:07:42,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 99 transitions, 372 flow [2025-03-04 15:07:42,500 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:07:42,505 INFO L231 Difference]: Finished difference. Result has 60 places, 61 transitions, 156 flow [2025-03-04 15:07:42,507 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:07:42,510 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2025-03-04 15:07:42,512 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 156 flow [2025-03-04 15:07:42,512 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:07:42,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:42,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:42,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:07:42,512 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:07:42,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:42,514 INFO L85 PathProgramCache]: Analyzing trace with hash 413402228, now seen corresponding path program 1 times [2025-03-04 15:07:42,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:42,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347006089] [2025-03-04 15:07:42,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:42,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:42,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:07:42,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:07:42,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:42,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:42,770 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:07:42,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:42,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347006089] [2025-03-04 15:07:42,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347006089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:42,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:42,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:07:42,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083311089] [2025-03-04 15:07:42,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:42,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:07:42,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:42,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:07:42,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:07:42,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-04 15:07:42,782 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:07:42,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:42,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-04 15:07:42,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:43,075 INFO L124 PetriNetUnfolderBase]: 1019/2078 cut-off events. [2025-03-04 15:07:43,076 INFO L125 PetriNetUnfolderBase]: For 429/433 co-relation queries the response was YES. [2025-03-04 15:07:43,079 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:07:43,088 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 81 selfloop transitions, 6 changer transitions 0/108 dead transitions. [2025-03-04 15:07:43,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 108 transitions, 435 flow [2025-03-04 15:07:43,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:07:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:07:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 204 transitions. [2025-03-04 15:07:43,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6688524590163935 [2025-03-04 15:07:43,092 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:07:43,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 108 transitions, 435 flow [2025-03-04 15:07:43,095 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:07:43,096 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 174 flow [2025-03-04 15:07:43,096 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:07:43,097 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2025-03-04 15:07:43,097 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 174 flow [2025-03-04 15:07:43,097 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:07:43,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:43,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:43,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:07:43,097 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:07:43,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:43,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2142570392, now seen corresponding path program 1 times [2025-03-04 15:07:43,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:43,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218258990] [2025-03-04 15:07:43,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:43,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:43,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:07:43,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:07:43,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:43,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:43,404 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:07:43,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:43,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218258990] [2025-03-04 15:07:43,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218258990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:43,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:43,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:07:43,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74367067] [2025-03-04 15:07:43,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:43,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:07:43,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:43,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:07:43,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:07:43,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-04 15:07:43,416 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:07:43,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:43,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-04 15:07:43,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:43,736 INFO L124 PetriNetUnfolderBase]: 1147/2320 cut-off events. [2025-03-04 15:07:43,737 INFO L125 PetriNetUnfolderBase]: For 539/547 co-relation queries the response was YES. [2025-03-04 15:07:43,741 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:07:43,748 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 108 selfloop transitions, 11 changer transitions 0/140 dead transitions. [2025-03-04 15:07:43,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 140 transitions, 589 flow [2025-03-04 15:07:43,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:07:43,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:07:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 283 transitions. [2025-03-04 15:07:43,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6627634660421545 [2025-03-04 15:07:43,750 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:07:43,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 140 transitions, 589 flow [2025-03-04 15:07:43,752 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:07:43,753 INFO L231 Difference]: Finished difference. Result has 70 places, 68 transitions, 230 flow [2025-03-04 15:07:43,753 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:07:43,754 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2025-03-04 15:07:43,754 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 230 flow [2025-03-04 15:07:43,754 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:07:43,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:43,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:43,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:07:43,754 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:07:43,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:43,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1680534045, now seen corresponding path program 1 times [2025-03-04 15:07:43,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:43,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834785279] [2025-03-04 15:07:43,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:43,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:43,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:07:43,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:07:43,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:43,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:43,807 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:07:43,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:43,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834785279] [2025-03-04 15:07:43,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834785279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:43,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:43,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:07:43,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892992894] [2025-03-04 15:07:43,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:43,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:07:43,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:43,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:07:43,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:07:43,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 61 [2025-03-04 15:07:43,814 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:07:43,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:43,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 61 [2025-03-04 15:07:43,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:43,922 INFO L124 PetriNetUnfolderBase]: 515/1161 cut-off events. [2025-03-04 15:07:43,922 INFO L125 PetriNetUnfolderBase]: For 370/370 co-relation queries the response was YES. [2025-03-04 15:07:43,925 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:07:43,928 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 42 selfloop transitions, 2 changer transitions 6/73 dead transitions. [2025-03-04 15:07:43,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 317 flow [2025-03-04 15:07:43,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:07:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:07:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-03-04 15:07:43,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6557377049180327 [2025-03-04 15:07:43,929 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:07:43,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 317 flow [2025-03-04 15:07:43,932 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:07:43,934 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 183 flow [2025-03-04 15:07:43,934 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:07:43,935 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2025-03-04 15:07:43,935 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 183 flow [2025-03-04 15:07:43,935 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:07:43,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:43,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:43,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:07:43,936 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:07:43,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:43,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1995172305, now seen corresponding path program 1 times [2025-03-04 15:07:43,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:43,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361225622] [2025-03-04 15:07:43,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:43,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:07:43,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:07:43,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:43,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:43,988 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:07:43,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:43,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361225622] [2025-03-04 15:07:43,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361225622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:43,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:43,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:07:43,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36109002] [2025-03-04 15:07:43,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:43,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:07:43,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:43,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:07:43,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:07:43,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-04 15:07:43,995 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:07:43,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:43,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-04 15:07:43,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:44,131 INFO L124 PetriNetUnfolderBase]: 440/978 cut-off events. [2025-03-04 15:07:44,132 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-04 15:07:44,133 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:07:44,136 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 53 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-03-04 15:07:44,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 77 transitions, 325 flow [2025-03-04 15:07:44,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:07:44,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:07:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2025-03-04 15:07:44,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6188524590163934 [2025-03-04 15:07:44,138 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:07:44,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 77 transitions, 325 flow [2025-03-04 15:07:44,139 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:07:44,140 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 195 flow [2025-03-04 15:07:44,140 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:07:44,143 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2025-03-04 15:07:44,144 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 195 flow [2025-03-04 15:07:44,144 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:07:44,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:44,144 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:44,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:07:44,145 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:07:44,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:44,145 INFO L85 PathProgramCache]: Analyzing trace with hash 126314271, now seen corresponding path program 1 times [2025-03-04 15:07:44,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:44,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628428570] [2025-03-04 15:07:44,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:44,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:44,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:07:44,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:07:44,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:44,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:44,364 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:07:44,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:44,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628428570] [2025-03-04 15:07:44,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628428570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:44,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:44,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:07:44,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347951667] [2025-03-04 15:07:44,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:44,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:07:44,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:44,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:07:44,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:07:44,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 61 [2025-03-04 15:07:44,366 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:07:44,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:44,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 61 [2025-03-04 15:07:44,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:44,538 INFO L124 PetriNetUnfolderBase]: 398/936 cut-off events. [2025-03-04 15:07:44,539 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2025-03-04 15:07:44,541 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:07:44,544 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 55 selfloop transitions, 5 changer transitions 3/86 dead transitions. [2025-03-04 15:07:44,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 86 transitions, 371 flow [2025-03-04 15:07:44,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:07:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:07:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2025-03-04 15:07:44,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6131147540983607 [2025-03-04 15:07:44,547 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:07:44,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 86 transitions, 371 flow [2025-03-04 15:07:44,548 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:07:44,549 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 198 flow [2025-03-04 15:07:44,550 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:07:44,550 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2025-03-04 15:07:44,551 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 198 flow [2025-03-04 15:07:44,553 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:07:44,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:44,553 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:07:44,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:07:44,553 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:07:44,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:44,554 INFO L85 PathProgramCache]: Analyzing trace with hash -456864327, now seen corresponding path program 1 times [2025-03-04 15:07:44,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:44,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881483538] [2025-03-04 15:07:44,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:44,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:44,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:07:44,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:07:44,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:44,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:45,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:45,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881483538] [2025-03-04 15:07:45,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881483538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:07:45,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954414866] [2025-03-04 15:07:45,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:45,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:07:45,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:07:45,108 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:07:45,109 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:07:45,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:07:45,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:07:45,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:45,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:45,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 15:07:45,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:07:45,318 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:07:45,369 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:07:45,446 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:07:45,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:07:45,457 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:07:45,487 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:07:45,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:07:45,710 INFO L349 Elim1Store]: treesize reduction 47, result has 53.5 percent of original size [2025-03-04 15:07:45,710 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 438 treesize of output 343 [2025-03-04 15:07:45,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:07:45,734 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 179 treesize of output 169 [2025-03-04 15:07:45,753 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 9 treesize of output 5 [2025-03-04 15:07:45,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:07:45,827 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 184 treesize of output 180 [2025-03-04 15:07:46,119 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:07:46,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954414866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:07:46,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:07:46,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-04 15:07:46,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025030188] [2025-03-04 15:07:46,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:07:46,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:07:46,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:46,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:07:46,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:07:46,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-03-04 15:07:46,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 198 flow. Second operand has 19 states, 19 states have (on average 22.210526315789473) internal successors, (422), 19 states have internal predecessors, (422), 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:07:46,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:46,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-03-04 15:07:46,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:46,918 INFO L124 PetriNetUnfolderBase]: 769/1658 cut-off events. [2025-03-04 15:07:46,918 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2025-03-04 15:07:46,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3625 conditions, 1658 events. 769/1658 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9238 event pairs, 123 based on Foata normal form. 24/1573 useless extension candidates. Maximal degree in co-relation 2834. Up to 250 conditions per place. [2025-03-04 15:07:46,926 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 128 selfloop transitions, 16 changer transitions 3/165 dead transitions. [2025-03-04 15:07:46,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 165 transitions, 744 flow [2025-03-04 15:07:46,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:07:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:07:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 427 transitions. [2025-03-04 15:07:46,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 15:07:46,927 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 198 flow. Second operand 14 states and 427 transitions. [2025-03-04 15:07:46,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 165 transitions, 744 flow [2025-03-04 15:07:46,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 165 transitions, 734 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:07:46,931 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 254 flow [2025-03-04 15:07:46,931 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=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=254, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2025-03-04 15:07:46,956 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 26 predicate places. [2025-03-04 15:07:46,956 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 254 flow [2025-03-04 15:07:46,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 22.210526315789473) internal successors, (422), 19 states have internal predecessors, (422), 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:07:46,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:46,956 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:07:46,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:07:47,157 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:07:47,157 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:07:47,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:47,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1277891672, now seen corresponding path program 1 times [2025-03-04 15:07:47,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:47,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012151362] [2025-03-04 15:07:47,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:47,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:47,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:07:47,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:07:47,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:47,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:47,645 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:07:47,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:47,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012151362] [2025-03-04 15:07:47,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012151362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:07:47,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894830804] [2025-03-04 15:07:47,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:47,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:07:47,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:07:47,647 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:07:47,649 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:07:47,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:07:47,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:07:47,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:47,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:47,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 15:07:47,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:07:47,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2025-03-04 15:07:47,832 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:07:47,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:07:47,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:07:47,857 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2025-03-04 15:07:47,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2025-03-04 15:07:47,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:07:47,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:07:47,935 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:07:47,938 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:07:47,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 39 [2025-03-04 15:07:48,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2025-03-04 15:07:48,115 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2025-03-04 15:07:48,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 59 [2025-03-04 15:07:48,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:07:48,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 13 [2025-03-04 15:07:48,122 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:07:48,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:07:49,976 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:07:49,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894830804] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:07:49,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:07:49,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-03-04 15:07:49,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338195944] [2025-03-04 15:07:49,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:07:49,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:07:49,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:49,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:07:49,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=266, Unknown=1, NotChecked=0, Total=342 [2025-03-04 15:07:51,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:07:53,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:07:53,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-03-04 15:07:53,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 254 flow. Second operand has 19 states, 19 states have (on average 22.157894736842106) internal successors, (421), 19 states have internal predecessors, (421), 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:07:53,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:53,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-03-04 15:07:53,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:57,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:07:57,800 INFO L124 PetriNetUnfolderBase]: 1291/2822 cut-off events. [2025-03-04 15:07:57,801 INFO L125 PetriNetUnfolderBase]: For 1181/1181 co-relation queries the response was YES. [2025-03-04 15:07:57,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6447 conditions, 2822 events. 1291/2822 cut-off events. For 1181/1181 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 17869 event pairs, 183 based on Foata normal form. 36/2676 useless extension candidates. Maximal degree in co-relation 5286. Up to 1057 conditions per place. [2025-03-04 15:07:57,816 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 146 selfloop transitions, 18 changer transitions 3/185 dead transitions. [2025-03-04 15:07:57,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 185 transitions, 915 flow [2025-03-04 15:07:57,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:07:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:07:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 419 transitions. [2025-03-04 15:07:57,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5283732660781841 [2025-03-04 15:07:57,819 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 254 flow. Second operand 13 states and 419 transitions. [2025-03-04 15:07:57,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 185 transitions, 915 flow [2025-03-04 15:07:57,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 185 transitions, 882 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-03-04 15:07:57,831 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 378 flow [2025-03-04 15:07:57,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=378, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2025-03-04 15:07:57,831 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2025-03-04 15:07:57,831 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 378 flow [2025-03-04 15:07:57,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 22.157894736842106) internal successors, (421), 19 states have internal predecessors, (421), 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:07:57,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:57,832 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:07:57,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:07:58,032 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:07:58,033 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:07:58,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:58,033 INFO L85 PathProgramCache]: Analyzing trace with hash 306770380, now seen corresponding path program 1 times [2025-03-04 15:07:58,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:58,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142016046] [2025-03-04 15:07:58,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:58,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:58,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:07:58,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:07:58,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:58,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:58,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:58,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:58,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142016046] [2025-03-04 15:07:58,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142016046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:07:58,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505359431] [2025-03-04 15:07:58,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:58,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:07:58,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:07:58,263 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:07:58,265 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:07:58,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:07:58,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:07:58,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:58,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:58,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 15:07:58,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:07:58,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2025-03-04 15:07:58,417 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:07:58,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:07:58,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:07:58,438 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2025-03-04 15:07:58,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2025-03-04 15:07:58,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:07:58,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:07:58,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:07:58,486 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:07:58,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2025-03-04 15:07:58,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:07:58,549 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:07:58,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:07:58,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2025-03-04 15:07:58,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:07:58,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2025-03-04 15:07:58,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:58,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:07:58,804 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:07:58,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505359431] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:07:58,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:07:58,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2025-03-04 15:07:58,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880102629] [2025-03-04 15:07:58,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:07:58,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 15:07:58,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:58,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 15:07:58,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-03-04 15:07:58,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-03-04 15:07:58,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 378 flow. Second operand has 20 states, 20 states have (on average 24.35) internal successors, (487), 20 states have internal predecessors, (487), 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:07:58,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:58,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-03-04 15:07:58,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:00,143 INFO L124 PetriNetUnfolderBase]: 1670/3713 cut-off events. [2025-03-04 15:08:00,143 INFO L125 PetriNetUnfolderBase]: For 1899/1899 co-relation queries the response was YES. [2025-03-04 15:08:00,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8837 conditions, 3713 events. 1670/3713 cut-off events. For 1899/1899 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 25321 event pairs, 223 based on Foata normal form. 60/3537 useless extension candidates. Maximal degree in co-relation 7349. Up to 633 conditions per place. [2025-03-04 15:08:00,168 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 207 selfloop transitions, 40 changer transitions 3/270 dead transitions. [2025-03-04 15:08:00,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 270 transitions, 1386 flow [2025-03-04 15:08:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:08:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 15:08:00,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 701 transitions. [2025-03-04 15:08:00,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5472287275565965 [2025-03-04 15:08:00,171 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 378 flow. Second operand 21 states and 701 transitions. [2025-03-04 15:08:00,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 270 transitions, 1386 flow [2025-03-04 15:08:00,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 270 transitions, 1368 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 15:08:00,183 INFO L231 Difference]: Finished difference. Result has 112 places, 96 transitions, 544 flow [2025-03-04 15:08:00,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=544, PETRI_PLACES=112, PETRI_TRANSITIONS=96} [2025-03-04 15:08:00,184 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 55 predicate places. [2025-03-04 15:08:00,184 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 96 transitions, 544 flow [2025-03-04 15:08:00,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 24.35) internal successors, (487), 20 states have internal predecessors, (487), 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:00,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:00,184 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:08:00,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:00,385 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:08:00,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-04 15:08:00,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:00,386 INFO L85 PathProgramCache]: Analyzing trace with hash 919947774, now seen corresponding path program 1 times [2025-03-04 15:08:00,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:00,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651686020] [2025-03-04 15:08:00,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:00,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:00,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:08:00,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:08:00,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:00,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:00,776 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:08:00,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:00,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651686020] [2025-03-04 15:08:00,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651686020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:00,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302453573] [2025-03-04 15:08:00,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:00,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:00,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:00,779 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:08:00,781 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:08:00,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:08:00,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:08:00,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:00,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:00,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 15:08:00,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:00,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2025-03-04 15:08:00,945 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:08:00,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:08:00,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:08:00,967 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2025-03-04 15:08:00,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2025-03-04 15:08:01,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:08:01,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:08:01,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:08:01,010 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:08:01,012 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:08:01,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2025-03-04 15:08:01,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-03-04 15:08:01,124 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-04 15:08:01,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2025-03-04 15:08:01,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:08:01,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2025-03-04 15:08:01,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:08:01,158 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:01,161 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:08:01,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:01,488 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:08:01,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302453573] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:01,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:01,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2025-03-04 15:08:01,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747866987] [2025-03-04 15:08:01,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:01,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 15:08:01,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:01,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 15:08:01,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2025-03-04 15:08:01,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-04 15:08:01,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 96 transitions, 544 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:08:01,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:01,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-04 15:08:01,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:02,931 INFO L124 PetriNetUnfolderBase]: 1944/4487 cut-off events. [2025-03-04 15:08:02,931 INFO L125 PetriNetUnfolderBase]: For 4368/4368 co-relation queries the response was YES. [2025-03-04 15:08:02,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11279 conditions, 4487 events. 1944/4487 cut-off events. For 4368/4368 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 31272 event pairs, 263 based on Foata normal form. 48/4257 useless extension candidates. Maximal degree in co-relation 9464. Up to 1218 conditions per place. [2025-03-04 15:08:02,948 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 236 selfloop transitions, 39 changer transitions 3/299 dead transitions. [2025-03-04 15:08:02,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 299 transitions, 1673 flow [2025-03-04 15:08:02,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 15:08:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 15:08:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 791 transitions. [2025-03-04 15:08:02,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5637918745545261 [2025-03-04 15:08:02,951 INFO L175 Difference]: Start difference. First operand has 112 places, 96 transitions, 544 flow. Second operand 23 states and 791 transitions. [2025-03-04 15:08:02,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 299 transitions, 1673 flow [2025-03-04 15:08:02,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 299 transitions, 1546 flow, removed 35 selfloop flow, removed 10 redundant places. [2025-03-04 15:08:02,962 INFO L231 Difference]: Finished difference. Result has 132 places, 109 transitions, 671 flow [2025-03-04 15:08:02,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=671, PETRI_PLACES=132, PETRI_TRANSITIONS=109} [2025-03-04 15:08:02,963 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 75 predicate places. [2025-03-04 15:08:02,963 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 109 transitions, 671 flow [2025-03-04 15:08:02,963 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:08:02,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:02,964 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:08:02,970 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:08:03,168 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:08:03,168 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-04 15:08:03,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:03,169 INFO L85 PathProgramCache]: Analyzing trace with hash 919946781, now seen corresponding path program 1 times [2025-03-04 15:08:03,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:03,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882462328] [2025-03-04 15:08:03,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:03,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:03,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:08:03,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:08:03,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:03,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:03,220 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:08:03,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:03,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882462328] [2025-03-04 15:08:03,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882462328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:03,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379960121] [2025-03-04 15:08:03,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:03,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:03,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:03,222 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:08:03,224 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:08:03,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:08:03,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:08:03,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:03,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:03,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:08:03,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:03,330 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:08:03,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:03,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379960121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:03,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:03,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:08:03,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018719692] [2025-03-04 15:08:03,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:03,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:08:03,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:03,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:08:03,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:08:03,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-04 15:08:03,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 109 transitions, 671 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:08:03,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:03,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-04 15:08:03,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:03,738 INFO L124 PetriNetUnfolderBase]: 2019/4462 cut-off events. [2025-03-04 15:08:03,738 INFO L125 PetriNetUnfolderBase]: For 4482/4482 co-relation queries the response was YES. [2025-03-04 15:08:03,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11409 conditions, 4462 events. 2019/4462 cut-off events. For 4482/4482 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 30015 event pairs, 283 based on Foata normal form. 96/4232 useless extension candidates. Maximal degree in co-relation 10003. Up to 2771 conditions per place. [2025-03-04 15:08:03,760 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 104 selfloop transitions, 10 changer transitions 3/139 dead transitions. [2025-03-04 15:08:03,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 139 transitions, 972 flow [2025-03-04 15:08:03,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:08:03,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:08:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2025-03-04 15:08:03,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5737704918032787 [2025-03-04 15:08:03,763 INFO L175 Difference]: Start difference. First operand has 132 places, 109 transitions, 671 flow. Second operand 6 states and 210 transitions. [2025-03-04 15:08:03,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 139 transitions, 972 flow [2025-03-04 15:08:03,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 139 transitions, 924 flow, removed 3 selfloop flow, removed 12 redundant places. [2025-03-04 15:08:03,779 INFO L231 Difference]: Finished difference. Result has 124 places, 108 transitions, 639 flow [2025-03-04 15:08:03,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=639, PETRI_PLACES=124, PETRI_TRANSITIONS=108} [2025-03-04 15:08:03,780 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 67 predicate places. [2025-03-04 15:08:03,781 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 108 transitions, 639 flow [2025-03-04 15:08:03,781 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:08:03,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:03,781 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:08:03,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:03,982 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:08:03,982 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:08:03,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:03,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1546420273, now seen corresponding path program 1 times [2025-03-04 15:08:03,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:03,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800497659] [2025-03-04 15:08:03,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:03,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:03,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:08:04,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:08:04,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:04,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:04,025 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:08:04,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:04,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800497659] [2025-03-04 15:08:04,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800497659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:04,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:04,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:04,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510170839] [2025-03-04 15:08:04,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:04,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:04,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:04,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:04,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:04,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-04 15:08:04,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 108 transitions, 639 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:08:04,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:04,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-04 15:08:04,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:04,353 INFO L124 PetriNetUnfolderBase]: 1899/4250 cut-off events. [2025-03-04 15:08:04,354 INFO L125 PetriNetUnfolderBase]: For 4203/4203 co-relation queries the response was YES. [2025-03-04 15:08:04,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10855 conditions, 4250 events. 1899/4250 cut-off events. For 4203/4203 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 28609 event pairs, 988 based on Foata normal form. 96/4100 useless extension candidates. Maximal degree in co-relation 9494. Up to 1973 conditions per place. [2025-03-04 15:08:04,373 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 80 selfloop transitions, 19 changer transitions 0/121 dead transitions. [2025-03-04 15:08:04,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 121 transitions, 865 flow [2025-03-04 15:08:04,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-03-04 15:08:04,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5778688524590164 [2025-03-04 15:08:04,374 INFO L175 Difference]: Start difference. First operand has 124 places, 108 transitions, 639 flow. Second operand 4 states and 141 transitions. [2025-03-04 15:08:04,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 121 transitions, 865 flow [2025-03-04 15:08:04,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 121 transitions, 848 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-04 15:08:04,390 INFO L231 Difference]: Finished difference. Result has 121 places, 107 transitions, 656 flow [2025-03-04 15:08:04,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=656, PETRI_PLACES=121, PETRI_TRANSITIONS=107} [2025-03-04 15:08:04,391 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 64 predicate places. [2025-03-04 15:08:04,391 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 107 transitions, 656 flow [2025-03-04 15:08:04,392 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:08:04,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:04,392 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:08:04,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:08:04,392 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:08:04,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:04,393 INFO L85 PathProgramCache]: Analyzing trace with hash 680798795, now seen corresponding path program 1 times [2025-03-04 15:08:04,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:04,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716535231] [2025-03-04 15:08:04,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:04,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:04,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:08:04,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:08:04,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:04,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:04,443 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:08:04,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:04,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716535231] [2025-03-04 15:08:04,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716535231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:04,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736168653] [2025-03-04 15:08:04,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:04,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:04,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:04,446 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:08:04,448 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:08:04,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:08:04,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:08:04,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:04,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:04,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:08:04,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:04,568 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:08:04,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:04,598 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:08:04,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736168653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:04,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:04,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 15:08:04,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590002305] [2025-03-04 15:08:04,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:04,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:08:04,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:04,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:08:04,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:08:04,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-03-04 15:08:04,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 107 transitions, 656 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:08:04,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:04,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-03-04 15:08:04,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:05,022 INFO L124 PetriNetUnfolderBase]: 1614/3623 cut-off events. [2025-03-04 15:08:05,023 INFO L125 PetriNetUnfolderBase]: For 4233/4233 co-relation queries the response was YES. [2025-03-04 15:08:05,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9636 conditions, 3623 events. 1614/3623 cut-off events. For 4233/4233 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 23630 event pairs, 700 based on Foata normal form. 36/3464 useless extension candidates. Maximal degree in co-relation 8264. Up to 1400 conditions per place. [2025-03-04 15:08:05,039 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 106 selfloop transitions, 13 changer transitions 0/141 dead transitions. [2025-03-04 15:08:05,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 141 transitions, 965 flow [2025-03-04 15:08:05,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:08:05,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:08:05,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 245 transitions. [2025-03-04 15:08:05,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5737704918032787 [2025-03-04 15:08:05,041 INFO L175 Difference]: Start difference. First operand has 121 places, 107 transitions, 656 flow. Second operand 7 states and 245 transitions. [2025-03-04 15:08:05,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 141 transitions, 965 flow [2025-03-04 15:08:05,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 141 transitions, 930 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:05,056 INFO L231 Difference]: Finished difference. Result has 127 places, 106 transitions, 655 flow [2025-03-04 15:08:05,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=655, PETRI_PLACES=127, PETRI_TRANSITIONS=106} [2025-03-04 15:08:05,057 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 70 predicate places. [2025-03-04 15:08:05,057 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 106 transitions, 655 flow [2025-03-04 15:08:05,057 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:08:05,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:05,057 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:08:05,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:05,262 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:08:05,262 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:08:05,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1617945832, now seen corresponding path program 1 times [2025-03-04 15:08:05,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:05,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802551473] [2025-03-04 15:08:05,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:05,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:08:05,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:08:05,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:05,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:05,461 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:08:05,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:05,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802551473] [2025-03-04 15:08:05,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802551473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:05,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151456422] [2025-03-04 15:08:05,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:05,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:05,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:05,463 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:08:05,465 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:08:05,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:08:05,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:08:05,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:05,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:05,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 15:08:05,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:05,636 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 13 treesize of output 9 [2025-03-04 15:08:05,668 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:08:05,679 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-04 15:08:05,679 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:05,712 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 9 treesize of output 3 [2025-03-04 15:08:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:08:05,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:05,790 INFO L349 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2025-03-04 15:08:05,790 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 2 case distinctions, treesize of input 68 treesize of output 67 [2025-03-04 15:08:05,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:08:05,799 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 34 treesize of output 36 [2025-03-04 15:08:05,804 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 8 treesize of output 4 [2025-03-04 15:08:05,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:08:05,813 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 43 treesize of output 35 [2025-03-04 15:08:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:08:05,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151456422] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:05,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:05,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 15:08:05,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146483577] [2025-03-04 15:08:05,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:05,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 15:08:05,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:05,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 15:08:05,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-04 15:08:05,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 61 [2025-03-04 15:08:05,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 106 transitions, 655 flow. Second operand has 14 states, 14 states have (on average 28.357142857142858) internal successors, (397), 14 states have internal predecessors, (397), 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:05,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:05,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 61 [2025-03-04 15:08:05,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:06,530 INFO L124 PetriNetUnfolderBase]: 1435/3230 cut-off events. [2025-03-04 15:08:06,530 INFO L125 PetriNetUnfolderBase]: For 3669/3669 co-relation queries the response was YES. [2025-03-04 15:08:06,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8786 conditions, 3230 events. 1435/3230 cut-off events. For 3669/3669 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 20262 event pairs, 183 based on Foata normal form. 24/3096 useless extension candidates. Maximal degree in co-relation 7375. Up to 1106 conditions per place. [2025-03-04 15:08:06,545 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 107 selfloop transitions, 32 changer transitions 3/163 dead transitions. [2025-03-04 15:08:06,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 163 transitions, 1043 flow [2025-03-04 15:08:06,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:08:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:08:06,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 356 transitions. [2025-03-04 15:08:06,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5836065573770491 [2025-03-04 15:08:06,547 INFO L175 Difference]: Start difference. First operand has 127 places, 106 transitions, 655 flow. Second operand 10 states and 356 transitions. [2025-03-04 15:08:06,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 163 transitions, 1043 flow [2025-03-04 15:08:06,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 163 transitions, 964 flow, removed 6 selfloop flow, removed 13 redundant places. [2025-03-04 15:08:06,558 INFO L231 Difference]: Finished difference. Result has 124 places, 100 transitions, 600 flow [2025-03-04 15:08:06,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=600, PETRI_PLACES=124, PETRI_TRANSITIONS=100} [2025-03-04 15:08:06,558 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 67 predicate places. [2025-03-04 15:08:06,558 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 100 transitions, 600 flow [2025-03-04 15:08:06,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 28.357142857142858) internal successors, (397), 14 states have internal predecessors, (397), 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:06,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:06,559 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:06,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 15:08:06,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:06,763 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-04 15:08:06,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:06,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2039229310, now seen corresponding path program 2 times [2025-03-04 15:08:06,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:06,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872006065] [2025-03-04 15:08:06,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:06,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:06,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 15:08:06,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:08:06,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:06,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:07,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:07,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872006065] [2025-03-04 15:08:07,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872006065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:07,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603542724] [2025-03-04 15:08:07,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:07,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:07,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:07,321 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:07,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:08:07,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 15:08:07,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:08:07,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:07,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:07,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-04 15:08:07,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:07,482 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 17 treesize of output 22 [2025-03-04 15:08:07,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-03-04 15:08:07,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2025-03-04 15:08:07,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2025-03-04 15:08:07,754 INFO L349 Elim1Store]: treesize reduction 66, result has 25.0 percent of original size [2025-03-04 15:08:07,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 49 [2025-03-04 15:08:07,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2025-03-04 15:08:07,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2025-03-04 15:08:07,934 INFO L349 Elim1Store]: treesize reduction 66, result has 25.0 percent of original size [2025-03-04 15:08:07,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 49 [2025-03-04 15:08:07,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2025-03-04 15:08:08,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2025-03-04 15:08:08,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-03-04 15:08:08,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 15:08:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:08,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:45,636 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:45,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603542724] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:45,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:45,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 36 [2025-03-04 15:08:45,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472740300] [2025-03-04 15:08:45,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:45,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 15:08:45,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:45,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 15:08:45,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1035, Unknown=12, NotChecked=0, Total=1332 [2025-03-04 15:08:45,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2025-03-04 15:08:45,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 100 transitions, 600 flow. Second operand has 37 states, 37 states have (on average 21.43243243243243) internal successors, (793), 37 states have internal predecessors, (793), 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:45,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:45,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2025-03-04 15:08:45,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:49,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:08:53,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:08:55,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:08:57,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:08:59,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:09:02,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:09:04,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:09:06,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:09:09,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:09:11,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:09:13,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]