./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/stack-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/stack-1.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 a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:21:17,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:21:17,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:21:17,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:21:17,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:21:17,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:21:17,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:21:17,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:21:17,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:21:17,553 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:21:17,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:21:17,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:21:17,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:21:17,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:21:17,555 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:21:17,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:21:17,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:21:17,555 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:21:17,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:21:17,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:21:17,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:21:17,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:21:17,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:21:17,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:21:17,556 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:21:17,556 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:21:17,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:21:17,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:21:17,556 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:21:17,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:21:17,557 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:21:17,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:21:17,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:21:17,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:21:17,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:21:17,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:21:17,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:21:17,557 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:21:17,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:21:17,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:21:17,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:21:17,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:21:17,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:21:17,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:21:17,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:21:17,558 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 -> a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 [2025-03-09 06:21:17,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:21:17,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:21:17,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:21:17,810 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:21:17,810 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:21:17,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-1.i [2025-03-09 06:21:18,971 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f06fd3746/4f81d59bc80945d28e0b3621e68d9974/FLAG18edee6b1 [2025-03-09 06:21:19,274 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:21:19,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-1.i [2025-03-09 06:21:19,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f06fd3746/4f81d59bc80945d28e0b3621e68d9974/FLAG18edee6b1 [2025-03-09 06:21:19,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f06fd3746/4f81d59bc80945d28e0b3621e68d9974 [2025-03-09 06:21:19,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:21:19,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:21:19,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:21:19,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:21:19,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:21:19,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:21:19" (1/1) ... [2025-03-09 06:21:19,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5824e600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:19, skipping insertion in model container [2025-03-09 06:21:19,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:21:19" (1/1) ... [2025-03-09 06:21:19,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:21:19,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:21:19,699 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:21:19,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:21:19,789 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:21:19,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:19 WrapperNode [2025-03-09 06:21:19,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:21:19,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:21:19,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:21:19,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:21:19,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:19" (1/1) ... [2025-03-09 06:21:19,811 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:19" (1/1) ... [2025-03-09 06:21:19,826 INFO L138 Inliner]: procedures = 277, calls = 36, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 156 [2025-03-09 06:21:19,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:21:19,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:21:19,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:21:19,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:21:19,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:19" (1/1) ... [2025-03-09 06:21:19,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:19" (1/1) ... [2025-03-09 06:21:19,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:19" (1/1) ... [2025-03-09 06:21:19,847 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 7, 5]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 1 writes are split as follows [0, 1, 0]. [2025-03-09 06:21:19,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:19" (1/1) ... [2025-03-09 06:21:19,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:19" (1/1) ... [2025-03-09 06:21:19,853 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:19" (1/1) ... [2025-03-09 06:21:19,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:19" (1/1) ... [2025-03-09 06:21:19,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:19" (1/1) ... [2025-03-09 06:21:19,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:19" (1/1) ... [2025-03-09 06:21:19,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:21:19,859 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:21:19,859 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:21:19,859 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:21:19,860 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:19" (1/1) ... [2025-03-09 06:21:19,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:21:19,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:19,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 06:21:19,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 06:21:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-09 06:21:19,902 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-09 06:21:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-09 06:21:19,902 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-09 06:21:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 06:21:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:21:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:21:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:21:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:21:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:21:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:21:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 06:21:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:21:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:21:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:21:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:21:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:21:19,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:21:19,904 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:21:20,014 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:21:20,021 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:21:20,284 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-1: pop_#res#1 := 0; [2025-03-09 06:21:20,284 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L984: havoc pop_#t~mem37#1; [2025-03-09 06:21:20,284 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: havoc pop_#t~ret36#1; [2025-03-09 06:21:20,285 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:21:20,285 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:21:20,461 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:21:20,462 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:21:20,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:21:20 BoogieIcfgContainer [2025-03-09 06:21:20,462 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:21:20,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:21:20,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:21:20,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:21:20,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:21:19" (1/3) ... [2025-03-09 06:21:20,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c9ee26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:21:20, skipping insertion in model container [2025-03-09 06:21:20,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:21:19" (2/3) ... [2025-03-09 06:21:20,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c9ee26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:21:20, skipping insertion in model container [2025-03-09 06:21:20,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:21:20" (3/3) ... [2025-03-09 06:21:20,487 INFO L128 eAbstractionObserver]: Analyzing ICFG stack-1.i [2025-03-09 06:21:20,499 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:21:20,500 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack-1.i that has 3 procedures, 44 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-09 06:21:20,500 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:21:20,550 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 06:21:20,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 48 transitions, 110 flow [2025-03-09 06:21:20,596 INFO L124 PetriNetUnfolderBase]: 5/46 cut-off events. [2025-03-09 06:21:20,600 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 06:21:20,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 46 events. 5/46 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 132 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2025-03-09 06:21:20,605 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 48 transitions, 110 flow [2025-03-09 06:21:20,608 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 44 transitions, 97 flow [2025-03-09 06:21:20,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:21:20,628 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;@47d0c5f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:21:20,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-09 06:21:20,636 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:21:20,636 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-09 06:21:20,637 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:21:20,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:20,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:20,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:20,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:20,642 INFO L85 PathProgramCache]: Analyzing trace with hash -126740260, now seen corresponding path program 1 times [2025-03-09 06:21:20,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:20,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185546014] [2025-03-09 06:21:20,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:20,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:20,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:21:20,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:21:20,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:20,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:20,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:20,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185546014] [2025-03-09 06:21:20,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185546014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:20,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:20,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:21:20,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206536681] [2025-03-09 06:21:20,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:20,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:21:20,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:20,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:21:20,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:21:20,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-09 06:21:20,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:20,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:20,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-09 06:21:20,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:21,301 INFO L124 PetriNetUnfolderBase]: 726/1447 cut-off events. [2025-03-09 06:21:21,301 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-09 06:21:21,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2673 conditions, 1447 events. 726/1447 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7619 event pairs, 220 based on Foata normal form. 42/1347 useless extension candidates. Maximal degree in co-relation 2569. Up to 692 conditions per place. [2025-03-09 06:21:21,316 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 58 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2025-03-09 06:21:21,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 77 transitions, 298 flow [2025-03-09 06:21:21,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:21:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:21:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-03-09 06:21:21,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-03-09 06:21:21,329 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 97 flow. Second operand 4 states and 132 transitions. [2025-03-09 06:21:21,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 77 transitions, 298 flow [2025-03-09 06:21:21,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 289 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:21:21,336 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 128 flow [2025-03-09 06:21:21,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2025-03-09 06:21:21,343 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2025-03-09 06:21:21,343 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 128 flow [2025-03-09 06:21:21,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:21,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:21,344 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:21,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:21:21,344 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:21,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:21,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1459370476, now seen corresponding path program 1 times [2025-03-09 06:21:21,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:21,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236630118] [2025-03-09 06:21:21,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:21,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:21,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:21:21,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:21:21,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:21,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:21,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:21,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236630118] [2025-03-09 06:21:21,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236630118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:21,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:21,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:21:21,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146426981] [2025-03-09 06:21:21,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:21,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:21:21,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:21,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:21:21,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:21:21,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-09 06:21:21,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:21,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:21,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-09 06:21:21,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:21,739 INFO L124 PetriNetUnfolderBase]: 1176/2396 cut-off events. [2025-03-09 06:21:21,739 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2025-03-09 06:21:21,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4816 conditions, 2396 events. 1176/2396 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 13857 event pairs, 608 based on Foata normal form. 74/2312 useless extension candidates. Maximal degree in co-relation 4155. Up to 1292 conditions per place. [2025-03-09 06:21:21,752 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 71 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2025-03-09 06:21:21,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 88 transitions, 399 flow [2025-03-09 06:21:21,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:21:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:21:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-03-09 06:21:21,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-03-09 06:21:21,754 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 128 flow. Second operand 4 states and 132 transitions. [2025-03-09 06:21:21,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 88 transitions, 399 flow [2025-03-09 06:21:21,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 88 transitions, 399 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:21:21,756 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 152 flow [2025-03-09 06:21:21,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2025-03-09 06:21:21,757 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2025-03-09 06:21:21,757 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 152 flow [2025-03-09 06:21:21,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:21,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:21,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:21,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:21:21,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:21,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:21,758 INFO L85 PathProgramCache]: Analyzing trace with hash -12938668, now seen corresponding path program 1 times [2025-03-09 06:21:21,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:21,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222193731] [2025-03-09 06:21:21,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:21,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:21,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:21:21,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:21:21,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:21,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:21,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:21,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222193731] [2025-03-09 06:21:21,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222193731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:21,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:21,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:21:21,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850426076] [2025-03-09 06:21:21,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:21,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:21:21,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:21,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:21:21,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:21:21,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-09 06:21:21,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:21,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:21,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-09 06:21:21,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:22,163 INFO L124 PetriNetUnfolderBase]: 1703/3326 cut-off events. [2025-03-09 06:21:22,163 INFO L125 PetriNetUnfolderBase]: For 993/1035 co-relation queries the response was YES. [2025-03-09 06:21:22,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7360 conditions, 3326 events. 1703/3326 cut-off events. For 993/1035 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 21175 event pairs, 837 based on Foata normal form. 82/3289 useless extension candidates. Maximal degree in co-relation 5256. Up to 1936 conditions per place. [2025-03-09 06:21:22,179 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 72 selfloop transitions, 3 changer transitions 0/89 dead transitions. [2025-03-09 06:21:22,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 439 flow [2025-03-09 06:21:22,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:21:22,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:21:22,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2025-03-09 06:21:22,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6927083333333334 [2025-03-09 06:21:22,181 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 152 flow. Second operand 4 states and 133 transitions. [2025-03-09 06:21:22,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 439 flow [2025-03-09 06:21:22,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:21:22,186 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 174 flow [2025-03-09 06:21:22,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2025-03-09 06:21:22,186 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2025-03-09 06:21:22,186 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 174 flow [2025-03-09 06:21:22,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:22,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:22,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:22,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:21:22,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:22,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:22,187 INFO L85 PathProgramCache]: Analyzing trace with hash -751223364, now seen corresponding path program 1 times [2025-03-09 06:21:22,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:22,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844282923] [2025-03-09 06:21:22,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:22,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:22,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:21:22,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:21:22,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:22,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:22,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:22,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844282923] [2025-03-09 06:21:22,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844282923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:22,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:22,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:21:22,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826432694] [2025-03-09 06:21:22,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:22,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:21:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:22,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:21:22,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:21:22,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-09 06:21:22,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:22,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:22,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-09 06:21:22,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:22,547 INFO L124 PetriNetUnfolderBase]: 898/2005 cut-off events. [2025-03-09 06:21:22,548 INFO L125 PetriNetUnfolderBase]: For 973/1069 co-relation queries the response was YES. [2025-03-09 06:21:22,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4749 conditions, 2005 events. 898/2005 cut-off events. For 973/1069 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 11992 event pairs, 285 based on Foata normal form. 76/2036 useless extension candidates. Maximal degree in co-relation 3693. Up to 946 conditions per place. [2025-03-09 06:21:22,559 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 46 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-03-09 06:21:22,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 334 flow [2025-03-09 06:21:22,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:21:22,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:21:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-09 06:21:22,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-09 06:21:22,561 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 174 flow. Second operand 3 states and 96 transitions. [2025-03-09 06:21:22,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 334 flow [2025-03-09 06:21:22,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 328 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 06:21:22,567 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 173 flow [2025-03-09 06:21:22,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2025-03-09 06:21:22,568 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 12 predicate places. [2025-03-09 06:21:22,568 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 173 flow [2025-03-09 06:21:22,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:22,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:22,569 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:22,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:21:22,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:22,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:22,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1620399751, now seen corresponding path program 1 times [2025-03-09 06:21:22,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:22,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486741335] [2025-03-09 06:21:22,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:22,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:22,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:21:22,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:21:22,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:22,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:22,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:22,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486741335] [2025-03-09 06:21:22,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486741335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:22,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547844095] [2025-03-09 06:21:22,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:22,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:22,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:22,697 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:21:22,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:21:22,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:21:22,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:21:22,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:22,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:22,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:21:22,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:22,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:21:22,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547844095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:22,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:21:22,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 06:21:22,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755091759] [2025-03-09 06:21:22,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:22,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:21:22,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:22,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:21:22,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:21:22,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-09 06:21:22,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:22,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:22,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-09 06:21:22,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:23,116 INFO L124 PetriNetUnfolderBase]: 931/2021 cut-off events. [2025-03-09 06:21:23,117 INFO L125 PetriNetUnfolderBase]: For 1020/1126 co-relation queries the response was YES. [2025-03-09 06:21:23,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4989 conditions, 2021 events. 931/2021 cut-off events. For 1020/1126 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 11549 event pairs, 189 based on Foata normal form. 70/2038 useless extension candidates. Maximal degree in co-relation 2706. Up to 735 conditions per place. [2025-03-09 06:21:23,129 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 87 selfloop transitions, 9 changer transitions 0/109 dead transitions. [2025-03-09 06:21:23,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 109 transitions, 587 flow [2025-03-09 06:21:23,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:21:23,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:21:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2025-03-09 06:21:23,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2025-03-09 06:21:23,131 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 173 flow. Second operand 7 states and 188 transitions. [2025-03-09 06:21:23,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 109 transitions, 587 flow [2025-03-09 06:21:23,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 109 transitions, 577 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:21:23,135 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 229 flow [2025-03-09 06:21:23,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=229, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2025-03-09 06:21:23,136 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2025-03-09 06:21:23,136 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 229 flow [2025-03-09 06:21:23,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:23,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:23,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:23,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 06:21:23,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:23,341 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:23,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:23,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1936173365, now seen corresponding path program 1 times [2025-03-09 06:21:23,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:23,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462082537] [2025-03-09 06:21:23,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:23,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:23,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:21:23,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:21:23,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:23,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:23,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:23,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462082537] [2025-03-09 06:21:23,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462082537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:23,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:23,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:21:23,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705849429] [2025-03-09 06:21:23,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:23,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:21:23,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:23,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:21:23,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:21:23,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-09 06:21:23,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 229 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:23,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:23,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-09 06:21:23,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:23,665 INFO L124 PetriNetUnfolderBase]: 1173/2610 cut-off events. [2025-03-09 06:21:23,665 INFO L125 PetriNetUnfolderBase]: For 2091/2209 co-relation queries the response was YES. [2025-03-09 06:21:23,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6748 conditions, 2610 events. 1173/2610 cut-off events. For 2091/2209 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 16479 event pairs, 646 based on Foata normal form. 26/2633 useless extension candidates. Maximal degree in co-relation 5215. Up to 1363 conditions per place. [2025-03-09 06:21:23,676 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 63 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2025-03-09 06:21:23,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 84 transitions, 494 flow [2025-03-09 06:21:23,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:21:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:21:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-03-09 06:21:23,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2025-03-09 06:21:23,679 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 229 flow. Second operand 4 states and 115 transitions. [2025-03-09 06:21:23,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 84 transitions, 494 flow [2025-03-09 06:21:23,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 84 transitions, 486 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 06:21:23,684 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 271 flow [2025-03-09 06:21:23,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2025-03-09 06:21:23,686 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2025-03-09 06:21:23,686 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 271 flow [2025-03-09 06:21:23,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:23,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:23,687 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:23,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:21:23,687 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:23,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash 971739265, now seen corresponding path program 1 times [2025-03-09 06:21:23,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:23,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104864360] [2025-03-09 06:21:23,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:23,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:23,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:21:23,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:21:23,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:23,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:23,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:23,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104864360] [2025-03-09 06:21:23,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104864360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:23,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222928790] [2025-03-09 06:21:23,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:23,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:23,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:23,762 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:21:23,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:21:23,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:21:23,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:21:23,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:23,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:23,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:21:23,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:23,865 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:21:23,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222928790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:23,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:21:23,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-09 06:21:23,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082479909] [2025-03-09 06:21:23,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:23,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:21:23,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:23,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:21:23,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:21:23,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-09 06:21:23,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 271 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:23,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:23,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-09 06:21:23,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:24,136 INFO L124 PetriNetUnfolderBase]: 1483/2948 cut-off events. [2025-03-09 06:21:24,137 INFO L125 PetriNetUnfolderBase]: For 3272/3358 co-relation queries the response was YES. [2025-03-09 06:21:24,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8046 conditions, 2948 events. 1483/2948 cut-off events. For 3272/3358 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 17433 event pairs, 245 based on Foata normal form. 79/2946 useless extension candidates. Maximal degree in co-relation 6189. Up to 1306 conditions per place. [2025-03-09 06:21:24,150 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 78 selfloop transitions, 5 changer transitions 0/96 dead transitions. [2025-03-09 06:21:24,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 96 transitions, 653 flow [2025-03-09 06:21:24,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:21:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:21:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-09 06:21:24,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-03-09 06:21:24,151 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 271 flow. Second operand 4 states and 116 transitions. [2025-03-09 06:21:24,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 96 transitions, 653 flow [2025-03-09 06:21:24,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 96 transitions, 651 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:21:24,156 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 275 flow [2025-03-09 06:21:24,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=275, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2025-03-09 06:21:24,156 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 23 predicate places. [2025-03-09 06:21:24,157 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 275 flow [2025-03-09 06:21:24,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:24,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:24,157 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:24,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:21:24,357 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,SelfDestructingSolverStorable6 [2025-03-09 06:21:24,358 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:24,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:24,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1307214909, now seen corresponding path program 1 times [2025-03-09 06:21:24,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:24,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912063815] [2025-03-09 06:21:24,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:24,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:24,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:21:24,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:21:24,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:24,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:24,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:24,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:24,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912063815] [2025-03-09 06:21:24,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912063815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:24,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90145954] [2025-03-09 06:21:24,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:24,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:24,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:24,437 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:21:24,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:21:24,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:21:24,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:21:24,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:24,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:24,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:21:24,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:24,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:24,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:21:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:24,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90145954] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:21:24,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:21:24,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-09 06:21:24,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40277546] [2025-03-09 06:21:24,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:21:24,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 06:21:24,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:24,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:21:24,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:21:24,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-09 06:21:24,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 275 flow. Second operand has 12 states, 12 states have (on average 18.083333333333332) internal successors, (217), 12 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:24,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:24,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-09 06:21:24,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:25,340 INFO L124 PetriNetUnfolderBase]: 2547/5453 cut-off events. [2025-03-09 06:21:25,340 INFO L125 PetriNetUnfolderBase]: For 8542/8788 co-relation queries the response was YES. [2025-03-09 06:21:25,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15524 conditions, 5453 events. 2547/5453 cut-off events. For 8542/8788 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 35095 event pairs, 407 based on Foata normal form. 151/5603 useless extension candidates. Maximal degree in co-relation 8199. Up to 1167 conditions per place. [2025-03-09 06:21:25,370 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 191 selfloop transitions, 33 changer transitions 0/235 dead transitions. [2025-03-09 06:21:25,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 235 transitions, 1624 flow [2025-03-09 06:21:25,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 06:21:25,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-09 06:21:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 426 transitions. [2025-03-09 06:21:25,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5546875 [2025-03-09 06:21:25,372 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 275 flow. Second operand 16 states and 426 transitions. [2025-03-09 06:21:25,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 235 transitions, 1624 flow [2025-03-09 06:21:25,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 235 transitions, 1502 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-09 06:21:25,385 INFO L231 Difference]: Finished difference. Result has 86 places, 85 transitions, 594 flow [2025-03-09 06:21:25,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=594, PETRI_PLACES=86, PETRI_TRANSITIONS=85} [2025-03-09 06:21:25,387 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 40 predicate places. [2025-03-09 06:21:25,388 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 85 transitions, 594 flow [2025-03-09 06:21:25,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.083333333333332) internal successors, (217), 12 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:25,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:25,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:25,394 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-09 06:21:25,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:25,593 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:25,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:25,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1581657833, now seen corresponding path program 1 times [2025-03-09 06:21:25,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:25,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989556528] [2025-03-09 06:21:25,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:25,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:25,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:21:25,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:21:25,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:25,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:25,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989556528] [2025-03-09 06:21:25,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989556528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:25,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:25,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:21:25,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363784004] [2025-03-09 06:21:25,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:25,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:21:25,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:25,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:21:25,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:21:25,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-09 06:21:25,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 85 transitions, 594 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:25,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:25,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-09 06:21:25,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:26,133 INFO L124 PetriNetUnfolderBase]: 2796/5814 cut-off events. [2025-03-09 06:21:26,133 INFO L125 PetriNetUnfolderBase]: For 9962/10299 co-relation queries the response was YES. [2025-03-09 06:21:26,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16746 conditions, 5814 events. 2796/5814 cut-off events. For 9962/10299 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 37177 event pairs, 564 based on Foata normal form. 39/5852 useless extension candidates. Maximal degree in co-relation 13956. Up to 3403 conditions per place. [2025-03-09 06:21:26,160 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 119 selfloop transitions, 13 changer transitions 0/142 dead transitions. [2025-03-09 06:21:26,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 142 transitions, 1117 flow [2025-03-09 06:21:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:21:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:21:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2025-03-09 06:21:26,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5659722222222222 [2025-03-09 06:21:26,162 INFO L175 Difference]: Start difference. First operand has 86 places, 85 transitions, 594 flow. Second operand 6 states and 163 transitions. [2025-03-09 06:21:26,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 142 transitions, 1117 flow [2025-03-09 06:21:26,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 142 transitions, 1075 flow, removed 18 selfloop flow, removed 3 redundant places. [2025-03-09 06:21:26,176 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 653 flow [2025-03-09 06:21:26,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=653, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2025-03-09 06:21:26,176 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 45 predicate places. [2025-03-09 06:21:26,177 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 653 flow [2025-03-09 06:21:26,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:26,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:26,177 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:26,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:21:26,177 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:26,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:26,178 INFO L85 PathProgramCache]: Analyzing trace with hash 59146531, now seen corresponding path program 1 times [2025-03-09 06:21:26,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:26,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604398944] [2025-03-09 06:21:26,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:26,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:26,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:21:26,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:21:26,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:26,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:21:26,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:26,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604398944] [2025-03-09 06:21:26,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604398944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:26,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:26,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:21:26,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880581209] [2025-03-09 06:21:26,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:26,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:21:26,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:26,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:21:26,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:21:26,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-09 06:21:26,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 653 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:26,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:26,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-09 06:21:26,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:26,713 INFO L124 PetriNetUnfolderBase]: 3062/6447 cut-off events. [2025-03-09 06:21:26,714 INFO L125 PetriNetUnfolderBase]: For 11343/11481 co-relation queries the response was YES. [2025-03-09 06:21:26,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18212 conditions, 6447 events. 3062/6447 cut-off events. For 11343/11481 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 42667 event pairs, 581 based on Foata normal form. 0/6446 useless extension candidates. Maximal degree in co-relation 15404. Up to 2690 conditions per place. [2025-03-09 06:21:26,741 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 143 selfloop transitions, 6 changer transitions 0/172 dead transitions. [2025-03-09 06:21:26,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 172 transitions, 1615 flow [2025-03-09 06:21:26,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:21:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:21:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-09 06:21:26,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-03-09 06:21:26,742 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 653 flow. Second operand 4 states and 116 transitions. [2025-03-09 06:21:26,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 172 transitions, 1615 flow [2025-03-09 06:21:26,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 172 transitions, 1605 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:21:26,761 INFO L231 Difference]: Finished difference. Result has 92 places, 90 transitions, 665 flow [2025-03-09 06:21:26,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=665, PETRI_PLACES=92, PETRI_TRANSITIONS=90} [2025-03-09 06:21:26,762 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 46 predicate places. [2025-03-09 06:21:26,762 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 90 transitions, 665 flow [2025-03-09 06:21:26,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:26,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:26,763 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:26,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 06:21:26,763 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:26,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:26,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1885480841, now seen corresponding path program 1 times [2025-03-09 06:21:26,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:26,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123143070] [2025-03-09 06:21:26,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:26,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:26,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:21:26,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:21:26,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:26,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:26,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:26,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:26,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123143070] [2025-03-09 06:21:26,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123143070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:26,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413648878] [2025-03-09 06:21:26,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:26,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:26,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:26,847 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:21:26,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 06:21:26,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:21:26,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:21:26,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:26,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:26,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:21:26,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:26,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:21:26,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413648878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:26,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:21:26,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-09 06:21:26,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160195054] [2025-03-09 06:21:26,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:26,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:21:26,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:26,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:21:26,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:21:26,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-09 06:21:26,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 90 transitions, 665 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:26,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:26,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-09 06:21:26,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:27,532 INFO L124 PetriNetUnfolderBase]: 3167/6166 cut-off events. [2025-03-09 06:21:27,533 INFO L125 PetriNetUnfolderBase]: For 14469/14481 co-relation queries the response was YES. [2025-03-09 06:21:27,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19479 conditions, 6166 events. 3167/6166 cut-off events. For 14469/14481 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 38587 event pairs, 544 based on Foata normal form. 178/6161 useless extension candidates. Maximal degree in co-relation 18617. Up to 3741 conditions per place. [2025-03-09 06:21:27,575 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 96 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-03-09 06:21:27,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 123 transitions, 1087 flow [2025-03-09 06:21:27,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:21:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:21:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-09 06:21:27,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-09 06:21:27,576 INFO L175 Difference]: Start difference. First operand has 92 places, 90 transitions, 665 flow. Second operand 4 states and 112 transitions. [2025-03-09 06:21:27,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 123 transitions, 1087 flow [2025-03-09 06:21:27,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 123 transitions, 1065 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:21:27,599 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 663 flow [2025-03-09 06:21:27,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=663, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2025-03-09 06:21:27,600 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 46 predicate places. [2025-03-09 06:21:27,600 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 663 flow [2025-03-09 06:21:27,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:27,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:27,600 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:21:27,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 06:21:27,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:27,804 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:27,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:27,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1679635705, now seen corresponding path program 1 times [2025-03-09 06:21:27,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:27,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107612914] [2025-03-09 06:21:27,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:27,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:27,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 06:21:27,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 06:21:27,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:27,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:21:27,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:27,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107612914] [2025-03-09 06:21:27,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107612914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:27,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:27,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:21:27,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227393592] [2025-03-09 06:21:27,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:27,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:21:27,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:27,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:21:27,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:21:27,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-09 06:21:27,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 663 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:27,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:27,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-09 06:21:27,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:28,285 INFO L124 PetriNetUnfolderBase]: 2926/5852 cut-off events. [2025-03-09 06:21:28,285 INFO L125 PetriNetUnfolderBase]: For 12731/12756 co-relation queries the response was YES. [2025-03-09 06:21:28,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18203 conditions, 5852 events. 2926/5852 cut-off events. For 12731/12756 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 36762 event pairs, 615 based on Foata normal form. 178/6027 useless extension candidates. Maximal degree in co-relation 15480. Up to 2981 conditions per place. [2025-03-09 06:21:28,319 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 107 selfloop transitions, 6 changer transitions 0/135 dead transitions. [2025-03-09 06:21:28,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 135 transitions, 1215 flow [2025-03-09 06:21:28,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:21:28,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:21:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-09 06:21:28,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-03-09 06:21:28,327 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 663 flow. Second operand 4 states and 116 transitions. [2025-03-09 06:21:28,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 135 transitions, 1215 flow [2025-03-09 06:21:28,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 135 transitions, 1205 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:21:28,349 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 669 flow [2025-03-09 06:21:28,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=669, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2025-03-09 06:21:28,352 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 46 predicate places. [2025-03-09 06:21:28,352 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 669 flow [2025-03-09 06:21:28,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:28,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:28,352 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:28,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:21:28,353 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:28,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:28,354 INFO L85 PathProgramCache]: Analyzing trace with hash 325732959, now seen corresponding path program 1 times [2025-03-09 06:21:28,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:28,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806387492] [2025-03-09 06:21:28,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:28,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:28,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:21:28,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:21:28,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:28,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:28,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:28,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:28,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806387492] [2025-03-09 06:21:28,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806387492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:28,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:28,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:21:28,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054881216] [2025-03-09 06:21:28,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:28,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:21:28,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:28,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:21:28,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:21:28,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-09 06:21:28,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 669 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:28,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:28,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-09 06:21:28,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:28,915 INFO L124 PetriNetUnfolderBase]: 2862/5764 cut-off events. [2025-03-09 06:21:28,915 INFO L125 PetriNetUnfolderBase]: For 14686/14686 co-relation queries the response was YES. [2025-03-09 06:21:28,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18439 conditions, 5764 events. 2862/5764 cut-off events. For 14686/14686 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 36280 event pairs, 455 based on Foata normal form. 104/5863 useless extension candidates. Maximal degree in co-relation 15447. Up to 3054 conditions per place. [2025-03-09 06:21:28,950 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 85 selfloop transitions, 35 changer transitions 0/129 dead transitions. [2025-03-09 06:21:28,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 129 transitions, 1104 flow [2025-03-09 06:21:28,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:21:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:21:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2025-03-09 06:21:28,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2025-03-09 06:21:28,951 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 669 flow. Second operand 7 states and 162 transitions. [2025-03-09 06:21:28,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 129 transitions, 1104 flow [2025-03-09 06:21:28,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 129 transitions, 1080 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 06:21:28,973 INFO L231 Difference]: Finished difference. Result has 93 places, 85 transitions, 752 flow [2025-03-09 06:21:28,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=752, PETRI_PLACES=93, PETRI_TRANSITIONS=85} [2025-03-09 06:21:28,974 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 47 predicate places. [2025-03-09 06:21:28,974 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 85 transitions, 752 flow [2025-03-09 06:21:28,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:28,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:28,975 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:28,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 06:21:28,975 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:28,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:28,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1810536519, now seen corresponding path program 1 times [2025-03-09 06:21:28,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:28,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124257630] [2025-03-09 06:21:28,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:28,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:28,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 06:21:28,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:21:28,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:28,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:29,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:29,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124257630] [2025-03-09 06:21:29,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124257630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:29,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:29,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:21:29,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807320155] [2025-03-09 06:21:29,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:29,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:21:29,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:29,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:21:29,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:21:29,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-09 06:21:29,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 752 flow. Second operand has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:29,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:29,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-09 06:21:29,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:29,665 INFO L124 PetriNetUnfolderBase]: 3126/6311 cut-off events. [2025-03-09 06:21:29,665 INFO L125 PetriNetUnfolderBase]: For 19709/19709 co-relation queries the response was YES. [2025-03-09 06:21:29,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20393 conditions, 6311 events. 3126/6311 cut-off events. For 19709/19709 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 40263 event pairs, 622 based on Foata normal form. 76/6382 useless extension candidates. Maximal degree in co-relation 17365. Up to 3339 conditions per place. [2025-03-09 06:21:29,698 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 132 selfloop transitions, 17 changer transitions 6/164 dead transitions. [2025-03-09 06:21:29,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 164 transitions, 1455 flow [2025-03-09 06:21:29,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:21:29,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 06:21:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2025-03-09 06:21:29,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5390625 [2025-03-09 06:21:29,699 INFO L175 Difference]: Start difference. First operand has 93 places, 85 transitions, 752 flow. Second operand 8 states and 207 transitions. [2025-03-09 06:21:29,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 164 transitions, 1455 flow [2025-03-09 06:21:29,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 164 transitions, 1435 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-09 06:21:29,722 INFO L231 Difference]: Finished difference. Result has 103 places, 90 transitions, 873 flow [2025-03-09 06:21:29,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=873, PETRI_PLACES=103, PETRI_TRANSITIONS=90} [2025-03-09 06:21:29,723 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 57 predicate places. [2025-03-09 06:21:29,723 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 90 transitions, 873 flow [2025-03-09 06:21:29,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:29,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:29,723 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:29,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 06:21:29,723 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:29,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:29,724 INFO L85 PathProgramCache]: Analyzing trace with hash 391598112, now seen corresponding path program 1 times [2025-03-09 06:21:29,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:29,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769233848] [2025-03-09 06:21:29,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:29,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:29,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 06:21:29,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:21:29,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:29,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:29,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:29,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769233848] [2025-03-09 06:21:29,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769233848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:29,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36499534] [2025-03-09 06:21:29,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:29,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:29,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:29,838 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:21:29,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 06:21:29,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 06:21:29,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:21:29,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:29,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:29,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:21:29,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:29,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:21:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:30,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36499534] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:21:30,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:21:30,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-09 06:21:30,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785395439] [2025-03-09 06:21:30,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:21:30,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 06:21:30,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:30,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 06:21:30,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-09 06:21:30,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-09 06:21:30,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 90 transitions, 873 flow. Second operand has 16 states, 16 states have (on average 16.625) internal successors, (266), 16 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:30,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:30,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-09 06:21:30,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:30,871 INFO L124 PetriNetUnfolderBase]: 3465/7035 cut-off events. [2025-03-09 06:21:30,871 INFO L125 PetriNetUnfolderBase]: For 25302/25302 co-relation queries the response was YES. [2025-03-09 06:21:30,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23114 conditions, 7035 events. 3465/7035 cut-off events. For 25302/25302 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 46495 event pairs, 609 based on Foata normal form. 176/7206 useless extension candidates. Maximal degree in co-relation 20222. Up to 1682 conditions per place. [2025-03-09 06:21:30,900 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 174 selfloop transitions, 58 changer transitions 18/259 dead transitions. [2025-03-09 06:21:30,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 259 transitions, 2200 flow [2025-03-09 06:21:30,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 06:21:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-09 06:21:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 426 transitions. [2025-03-09 06:21:30,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2025-03-09 06:21:30,901 INFO L175 Difference]: Start difference. First operand has 103 places, 90 transitions, 873 flow. Second operand 18 states and 426 transitions. [2025-03-09 06:21:30,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 259 transitions, 2200 flow [2025-03-09 06:21:30,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 259 transitions, 2178 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-09 06:21:30,927 INFO L231 Difference]: Finished difference. Result has 118 places, 98 transitions, 1115 flow [2025-03-09 06:21:30,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1115, PETRI_PLACES=118, PETRI_TRANSITIONS=98} [2025-03-09 06:21:30,928 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 72 predicate places. [2025-03-09 06:21:30,928 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 98 transitions, 1115 flow [2025-03-09 06:21:30,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.625) internal successors, (266), 16 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:30,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:30,928 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-09 06:21:30,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:21:31,129 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,SelfDestructingSolverStorable14 [2025-03-09 06:21:31,129 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:31,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:31,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1413035470, now seen corresponding path program 2 times [2025-03-09 06:21:31,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:31,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522861676] [2025-03-09 06:21:31,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:21:31,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:31,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-09 06:21:31,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 06:21:31,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:21:31,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:31,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:31,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522861676] [2025-03-09 06:21:31,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522861676] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:31,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148452095] [2025-03-09 06:21:31,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:21:31,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:31,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:31,311 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:21:31,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 06:21:31,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-09 06:21:31,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 06:21:31,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:21:31,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:31,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:21:31,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:31,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:21:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:31,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148452095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:21:31,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:21:31,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-09 06:21:31,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802644576] [2025-03-09 06:21:31,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:21:31,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 06:21:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:31,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 06:21:31,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-09 06:21:31,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-09 06:21:31,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 98 transitions, 1115 flow. Second operand has 24 states, 24 states have (on average 18.541666666666668) internal successors, (445), 24 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:31,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:31,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-09 06:21:31,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:33,067 INFO L124 PetriNetUnfolderBase]: 5099/10505 cut-off events. [2025-03-09 06:21:33,067 INFO L125 PetriNetUnfolderBase]: For 45598/45598 co-relation queries the response was YES. [2025-03-09 06:21:33,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36063 conditions, 10505 events. 5099/10505 cut-off events. For 45598/45598 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 64231 event pairs, 929 based on Foata normal form. 208/10708 useless extension candidates. Maximal degree in co-relation 29035. Up to 2336 conditions per place. [2025-03-09 06:21:33,123 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 349 selfloop transitions, 73 changer transitions 0/431 dead transitions. [2025-03-09 06:21:33,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 431 transitions, 4018 flow [2025-03-09 06:21:33,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 06:21:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-09 06:21:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 672 transitions. [2025-03-09 06:21:33,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-09 06:21:33,125 INFO L175 Difference]: Start difference. First operand has 118 places, 98 transitions, 1115 flow. Second operand 24 states and 672 transitions. [2025-03-09 06:21:33,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 431 transitions, 4018 flow [2025-03-09 06:21:33,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 431 transitions, 3818 flow, removed 66 selfloop flow, removed 7 redundant places. [2025-03-09 06:21:33,177 INFO L231 Difference]: Finished difference. Result has 138 places, 140 transitions, 1835 flow [2025-03-09 06:21:33,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1835, PETRI_PLACES=138, PETRI_TRANSITIONS=140} [2025-03-09 06:21:33,178 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 92 predicate places. [2025-03-09 06:21:33,178 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 140 transitions, 1835 flow [2025-03-09 06:21:33,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 18.541666666666668) internal successors, (445), 24 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:33,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:33,178 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:33,184 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-09 06:21:33,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 06:21:33,379 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:33,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:33,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1624426207, now seen corresponding path program 2 times [2025-03-09 06:21:33,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:33,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535637304] [2025-03-09 06:21:33,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:21:33,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:33,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-09 06:21:33,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:21:33,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:21:33,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:33,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:33,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535637304] [2025-03-09 06:21:33,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535637304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:33,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665873746] [2025-03-09 06:21:33,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:21:33,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:33,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:33,701 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:21:33,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 06:21:33,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-09 06:21:33,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:21:33,805 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:21:33,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:33,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:21:33,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:33,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:21:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:33,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665873746] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:21:33,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:21:33,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2025-03-09 06:21:33,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31431135] [2025-03-09 06:21:33,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:21:33,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 06:21:33,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:33,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 06:21:33,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-03-09 06:21:34,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-09 06:21:34,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 140 transitions, 1835 flow. Second operand has 20 states, 20 states have (on average 17.25) internal successors, (345), 20 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:34,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:34,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-09 06:21:34,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:35,891 INFO L124 PetriNetUnfolderBase]: 6331/12935 cut-off events. [2025-03-09 06:21:35,891 INFO L125 PetriNetUnfolderBase]: For 63440/63440 co-relation queries the response was YES. [2025-03-09 06:21:35,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44686 conditions, 12935 events. 6331/12935 cut-off events. For 63440/63440 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 83461 event pairs, 779 based on Foata normal form. 72/13002 useless extension candidates. Maximal degree in co-relation 41647. Up to 3367 conditions per place. [2025-03-09 06:21:35,965 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 273 selfloop transitions, 101 changer transitions 0/383 dead transitions. [2025-03-09 06:21:35,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 383 transitions, 4014 flow [2025-03-09 06:21:35,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 06:21:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-09 06:21:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 525 transitions. [2025-03-09 06:21:35,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4971590909090909 [2025-03-09 06:21:35,967 INFO L175 Difference]: Start difference. First operand has 138 places, 140 transitions, 1835 flow. Second operand 22 states and 525 transitions. [2025-03-09 06:21:35,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 383 transitions, 4014 flow [2025-03-09 06:21:36,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 383 transitions, 3859 flow, removed 23 selfloop flow, removed 9 redundant places. [2025-03-09 06:21:36,048 INFO L231 Difference]: Finished difference. Result has 158 places, 174 transitions, 2540 flow [2025-03-09 06:21:36,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2540, PETRI_PLACES=158, PETRI_TRANSITIONS=174} [2025-03-09 06:21:36,049 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 112 predicate places. [2025-03-09 06:21:36,049 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 174 transitions, 2540 flow [2025-03-09 06:21:36,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 17.25) internal successors, (345), 20 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:36,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:36,049 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:36,056 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-09 06:21:36,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:36,250 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:36,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:36,250 INFO L85 PathProgramCache]: Analyzing trace with hash 796281781, now seen corresponding path program 3 times [2025-03-09 06:21:36,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:36,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545876061] [2025-03-09 06:21:36,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:21:36,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:36,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 4 equivalence classes. [2025-03-09 06:21:36,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 06:21:36,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 06:21:36,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:36,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:36,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545876061] [2025-03-09 06:21:36,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545876061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:36,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837282461] [2025-03-09 06:21:36,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:21:36,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:36,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:36,807 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-09 06:21:36,809 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-09 06:21:36,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 4 equivalence classes. [2025-03-09 06:21:36,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 06:21:36,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 06:21:36,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:36,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 06:21:36,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:37,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:21:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:37,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837282461] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:21:37,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:21:37,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2025-03-09 06:21:37,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301761574] [2025-03-09 06:21:37,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:21:37,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-09 06:21:37,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:37,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-09 06:21:37,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2025-03-09 06:21:37,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-09 06:21:37,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 174 transitions, 2540 flow. Second operand has 30 states, 30 states have (on average 17.166666666666668) internal successors, (515), 30 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:37,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:37,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-09 06:21:37,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:39,852 INFO L124 PetriNetUnfolderBase]: 8175/16641 cut-off events. [2025-03-09 06:21:39,853 INFO L125 PetriNetUnfolderBase]: For 102040/102040 co-relation queries the response was YES. [2025-03-09 06:21:39,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59212 conditions, 16641 events. 8175/16641 cut-off events. For 102040/102040 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 114211 event pairs, 813 based on Foata normal form. 126/16762 useless extension candidates. Maximal degree in co-relation 56096. Up to 2848 conditions per place. [2025-03-09 06:21:39,992 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 401 selfloop transitions, 182 changer transitions 0/592 dead transitions. [2025-03-09 06:21:39,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 592 transitions, 6281 flow [2025-03-09 06:21:39,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-09 06:21:39,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-09 06:21:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 851 transitions. [2025-03-09 06:21:39,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49247685185185186 [2025-03-09 06:21:39,994 INFO L175 Difference]: Start difference. First operand has 158 places, 174 transitions, 2540 flow. Second operand 36 states and 851 transitions. [2025-03-09 06:21:39,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 592 transitions, 6281 flow [2025-03-09 06:21:40,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 592 transitions, 6166 flow, removed 35 selfloop flow, removed 5 redundant places. [2025-03-09 06:21:40,202 INFO L231 Difference]: Finished difference. Result has 197 places, 237 transitions, 3934 flow [2025-03-09 06:21:40,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2431, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=3934, PETRI_PLACES=197, PETRI_TRANSITIONS=237} [2025-03-09 06:21:40,202 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 151 predicate places. [2025-03-09 06:21:40,202 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 237 transitions, 3934 flow [2025-03-09 06:21:40,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 17.166666666666668) internal successors, (515), 30 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:40,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:40,203 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:40,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 06:21:40,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 06:21:40,404 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-09 06:21:40,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:40,405 INFO L85 PathProgramCache]: Analyzing trace with hash -613887180, now seen corresponding path program 1 times [2025-03-09 06:21:40,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:40,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956757556] [2025-03-09 06:21:40,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:40,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:40,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 06:21:40,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 06:21:40,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:40,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:40,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:40,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956757556] [2025-03-09 06:21:40,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956757556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:40,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794442253] [2025-03-09 06:21:40,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:40,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:40,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:40,714 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:21:40,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 06:21:40,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 06:21:40,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 06:21:40,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:40,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:40,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:21:40,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:40,941 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:40,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:21:40,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794442253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:40,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:21:40,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 15 [2025-03-09 06:21:40,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824393171] [2025-03-09 06:21:40,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:40,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 06:21:40,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:40,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 06:21:40,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:21:40,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-09 06:21:40,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 237 transitions, 3934 flow. Second operand has 13 states, 13 states have (on average 20.307692307692307) internal successors, (264), 13 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:40,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:40,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-09 06:21:40,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:43,260 INFO L124 PetriNetUnfolderBase]: 8695/17363 cut-off events. [2025-03-09 06:21:43,260 INFO L125 PetriNetUnfolderBase]: For 89442/89474 co-relation queries the response was YES. [2025-03-09 06:21:43,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60715 conditions, 17363 events. 8695/17363 cut-off events. For 89442/89474 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 128900 event pairs, 11 based on Foata normal form. 434/17791 useless extension candidates. Maximal degree in co-relation 60662. Up to 4614 conditions per place. [2025-03-09 06:21:43,345 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 0 selfloop transitions, 0 changer transitions 604/604 dead transitions. [2025-03-09 06:21:43,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 604 transitions, 8779 flow [2025-03-09 06:21:43,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 06:21:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 06:21:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 398 transitions. [2025-03-09 06:21:43,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6378205128205128 [2025-03-09 06:21:43,347 INFO L175 Difference]: Start difference. First operand has 197 places, 237 transitions, 3934 flow. Second operand 13 states and 398 transitions. [2025-03-09 06:21:43,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 604 transitions, 8779 flow [2025-03-09 06:21:43,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 604 transitions, 7604 flow, removed 123 selfloop flow, removed 36 redundant places. [2025-03-09 06:21:43,459 INFO L231 Difference]: Finished difference. Result has 161 places, 0 transitions, 0 flow [2025-03-09 06:21:43,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=161, PETRI_TRANSITIONS=0} [2025-03-09 06:21:43,459 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 115 predicate places. [2025-03-09 06:21:43,459 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 0 transitions, 0 flow [2025-03-09 06:21:43,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 20.307692307692307) internal successors, (264), 13 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:43,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-09 06:21:43,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 18 remaining) [2025-03-09 06:21:43,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-09 06:21:43,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-09 06:21:43,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-09 06:21:43,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-09 06:21:43,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-09 06:21:43,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-09 06:21:43,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-09 06:21:43,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-09 06:21:43,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-09 06:21:43,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-09 06:21:43,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-09 06:21:43,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-09 06:21:43,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-09 06:21:43,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-09 06:21:43,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-09 06:21:43,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-09 06:21:43,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 06:21:43,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:43,664 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:43,667 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 06:21:43,667 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 06:21:43,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 06:21:43 BasicIcfg [2025-03-09 06:21:43,671 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 06:21:43,671 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:21:43,671 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:21:43,671 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:21:43,672 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:21:20" (3/4) ... [2025-03-09 06:21:43,672 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 06:21:43,674 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-03-09 06:21:43,674 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-03-09 06:21:43,676 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2025-03-09 06:21:43,676 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-09 06:21:43,676 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-09 06:21:43,676 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 06:21:43,730 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 06:21:43,731 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 06:21:43,731 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:21:43,733 INFO L158 Benchmark]: Toolchain (without parser) took 24421.48ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 110.9MB in the beginning and 428.7MB in the end (delta: -317.8MB). Peak memory consumption was 945.6MB. Max. memory is 16.1GB. [2025-03-09 06:21:43,733 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:21:43,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.09ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 81.8MB in the end (delta: 29.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 06:21:43,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.85ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 79.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:21:43,733 INFO L158 Benchmark]: Boogie Preprocessor took 29.82ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 77.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:21:43,734 INFO L158 Benchmark]: IcfgBuilder took 603.22ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 40.5MB in the end (delta: 37.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 06:21:43,734 INFO L158 Benchmark]: TraceAbstraction took 23190.25ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 109.0MB in the beginning and 431.0MB in the end (delta: -322.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-09 06:21:43,735 INFO L158 Benchmark]: Witness Printer took 59.61ms. Allocated memory is still 1.4GB. Free memory was 431.0MB in the beginning and 428.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:21:43,736 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.09ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 81.8MB in the end (delta: 29.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.85ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 79.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.82ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 77.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 603.22ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 40.5MB in the end (delta: 37.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23190.25ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 109.0MB in the beginning and 431.0MB in the end (delta: -322.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 59.61ms. Allocated memory is still 1.4GB. Free memory was 431.0MB in the beginning and 428.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 946]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 946]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 992]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 992]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 950]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1006]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 950]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1006]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 81 locations, 90 edges, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.1s, OverallIterations: 19, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2353 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2285 mSDsluCounter, 436 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 425 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5925 IncrementalHoareTripleChecker+Invalid, 6056 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 11 mSDtfsCounter, 5925 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 809 GetRequests, 572 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1263 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3934occurred in iteration=18, InterpolantAutomatonStates: 192, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 973 NumberOfCodeBlocks, 973 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1175 ConstructedInterpolants, 0 QuantifiedInterpolants, 3315 SizeOfPredicates, 31 NumberOfNonLiveVariables, 2620 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 33 InterpolantComputations, 14 PerfectInterpolantSequences, 191/786 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 06:21:43,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE