./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.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 5ac72ff2379990464c5f55660be1e08b12557a61aceeef8401296ef66be035fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:23:01,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:23:01,967 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:23:01,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:23:01,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:23:01,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:23:01,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:23:01,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:23:01,997 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:23:01,997 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:23:01,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:23:01,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:23:01,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:23:01,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:23:01,998 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:23:01,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:23:01,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:23:01,998 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:23:01,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:23:01,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:23:01,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:23:01,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:23:01,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:23:01,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:23:01,999 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:23:01,999 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:23:01,999 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:23:01,999 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:23:01,999 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:23:01,999 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:23:01,999 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:23:01,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:23:01,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:23:01,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:23:01,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:23:01,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:23:01,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:23:01,999 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:23:01,999 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:23:01,999 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:23:01,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:23:01,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:23:02,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:23:02,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:23:02,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:23:02,000 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 -> 5ac72ff2379990464c5f55660be1e08b12557a61aceeef8401296ef66be035fc [2025-03-04 15:23:02,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:23:02,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:23:02,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:23:02,221 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:23:02,221 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:23:02,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i [2025-03-04 15:23:03,448 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f051dfb90/80a88cddf48a4a12927e2f1a66ec6163/FLAGa384f3639 [2025-03-04 15:23:03,765 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:23:03,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i [2025-03-04 15:23:03,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f051dfb90/80a88cddf48a4a12927e2f1a66ec6163/FLAGa384f3639 [2025-03-04 15:23:03,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f051dfb90/80a88cddf48a4a12927e2f1a66ec6163 [2025-03-04 15:23:03,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:23:03,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:23:03,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:23:03,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:23:03,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:23:03,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:23:03" (1/1) ... [2025-03-04 15:23:03,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e519300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:03, skipping insertion in model container [2025-03-04 15:23:03,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:23:03" (1/1) ... [2025-03-04 15:23:03,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:23:04,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:23:04,169 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:23:04,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:23:04,274 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:23:04,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:04 WrapperNode [2025-03-04 15:23:04,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:23:04,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:23:04,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:23:04,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:23:04,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:04" (1/1) ... [2025-03-04 15:23:04,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:04" (1/1) ... [2025-03-04 15:23:04,318 INFO L138 Inliner]: procedures = 272, calls = 65, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 230 [2025-03-04 15:23:04,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:23:04,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:23:04,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:23:04,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:23:04,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:04" (1/1) ... [2025-03-04 15:23:04,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:04" (1/1) ... [2025-03-04 15:23:04,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:04" (1/1) ... [2025-03-04 15:23:04,352 INFO L175 MemorySlicer]: Split 35 memory accesses to 4 slices as follows [2, 5, 26, 2]. 74 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [2, 5, 16, 0]. The 5 writes are split as follows [0, 0, 4, 1]. [2025-03-04 15:23:04,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:04" (1/1) ... [2025-03-04 15:23:04,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:04" (1/1) ... [2025-03-04 15:23:04,361 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:04" (1/1) ... [2025-03-04 15:23:04,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:04" (1/1) ... [2025-03-04 15:23:04,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:04" (1/1) ... [2025-03-04 15:23:04,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:04" (1/1) ... [2025-03-04 15:23:04,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:23:04,374 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:23:04,374 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:23:04,374 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:23:04,375 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:04" (1/1) ... [2025-03-04 15:23:04,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:23:04,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:04,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:23:04,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:23:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:23:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:23:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:23:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:23:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:23:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:23:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:23:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:23:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:23:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:23:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:23:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:23:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:23:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:23:04,430 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:23:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:23:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:23:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:23:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:23:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:23:04,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:23:04,432 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:23:04,546 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:23:04,548 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:23:04,761 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 15:23:04,762 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 15:23:04,829 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:23:04,829 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:23:04,986 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:23:04,988 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:23:04,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:23:04 BoogieIcfgContainer [2025-03-04 15:23:04,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:23:04,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:23:04,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:23:04,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:23:04,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:23:03" (1/3) ... [2025-03-04 15:23:04,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9e51c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:23:04, skipping insertion in model container [2025-03-04 15:23:04,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:04" (2/3) ... [2025-03-04 15:23:04,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9e51c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:23:04, skipping insertion in model container [2025-03-04 15:23:04,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:23:04" (3/3) ... [2025-03-04 15:23:04,997 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_79-equ_racefree.i [2025-03-04 15:23:05,007 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:23:05,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_79-equ_racefree.i that has 2 procedures, 92 locations, 1 initial locations, 10 loop locations, and 16 error locations. [2025-03-04 15:23:05,010 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:23:05,056 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 15:23:05,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 117 transitions, 241 flow [2025-03-04 15:23:05,133 INFO L124 PetriNetUnfolderBase]: 36/164 cut-off events. [2025-03-04 15:23:05,135 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:23:05,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 164 events. 36/164 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 626 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 95. Up to 8 conditions per place. [2025-03-04 15:23:05,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 117 transitions, 241 flow [2025-03-04 15:23:05,144 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 115 transitions, 237 flow [2025-03-04 15:23:05,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:23:05,161 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;@4e0f30bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:23:05,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-04 15:23:05,166 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:23:05,166 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-04 15:23:05,167 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:23:05,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:05,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:23:05,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:05,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:05,174 INFO L85 PathProgramCache]: Analyzing trace with hash 16795364, now seen corresponding path program 1 times [2025-03-04 15:23:05,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:05,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886549254] [2025-03-04 15:23:05,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:05,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:05,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:23:05,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:23:05,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:05,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:05,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:05,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886549254] [2025-03-04 15:23:05,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886549254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:05,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:05,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:05,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603698297] [2025-03-04 15:23:05,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:05,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:05,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:05,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:05,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:05,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 117 [2025-03-04 15:23:05,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 115 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:05,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:05,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 117 [2025-03-04 15:23:05,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:05,881 INFO L124 PetriNetUnfolderBase]: 869/2651 cut-off events. [2025-03-04 15:23:05,881 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:23:05,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4383 conditions, 2651 events. 869/2651 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 21187 event pairs, 748 based on Foata normal form. 448/2785 useless extension candidates. Maximal degree in co-relation 2126. Up to 888 conditions per place. [2025-03-04 15:23:05,898 INFO L140 encePairwiseOnDemand]: 91/117 looper letters, 88 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-03-04 15:23:05,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 137 transitions, 473 flow [2025-03-04 15:23:05,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 310 transitions. [2025-03-04 15:23:05,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6623931623931624 [2025-03-04 15:23:05,912 INFO L175 Difference]: Start difference. First operand has 95 places, 115 transitions, 237 flow. Second operand 4 states and 310 transitions. [2025-03-04 15:23:05,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 137 transitions, 473 flow [2025-03-04 15:23:05,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 137 transitions, 473 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:23:05,920 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 214 flow [2025-03-04 15:23:05,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2025-03-04 15:23:05,923 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 3 predicate places. [2025-03-04 15:23:05,923 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 214 flow [2025-03-04 15:23:05,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:05,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:05,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:23:05,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:23:05,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:05,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:05,924 INFO L85 PathProgramCache]: Analyzing trace with hash 16795389, now seen corresponding path program 1 times [2025-03-04 15:23:05,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:05,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762225131] [2025-03-04 15:23:05,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:05,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:05,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:23:05,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:23:05,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:05,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:05,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:05,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762225131] [2025-03-04 15:23:05,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762225131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:05,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:05,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:05,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716194013] [2025-03-04 15:23:05,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:05,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:23:05,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:05,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:23:05,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:23:05,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 117 [2025-03-04 15:23:06,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:06,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:06,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 117 [2025-03-04 15:23:06,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:06,250 INFO L124 PetriNetUnfolderBase]: 869/2657 cut-off events. [2025-03-04 15:23:06,251 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 15:23:06,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4454 conditions, 2657 events. 869/2657 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 21251 event pairs, 765 based on Foata normal form. 1/2342 useless extension candidates. Maximal degree in co-relation 2225. Up to 1722 conditions per place. [2025-03-04 15:23:06,261 INFO L140 encePairwiseOnDemand]: 114/117 looper letters, 49 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2025-03-04 15:23:06,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 94 transitions, 314 flow [2025-03-04 15:23:06,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:06,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2025-03-04 15:23:06,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5213675213675214 [2025-03-04 15:23:06,263 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 214 flow. Second operand 3 states and 183 transitions. [2025-03-04 15:23:06,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 94 transitions, 314 flow [2025-03-04 15:23:06,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 309 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:06,269 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 211 flow [2025-03-04 15:23:06,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2025-03-04 15:23:06,269 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 2 predicate places. [2025-03-04 15:23:06,269 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 211 flow [2025-03-04 15:23:06,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:06,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:06,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:23:06,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:23:06,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:06,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:06,270 INFO L85 PathProgramCache]: Analyzing trace with hash 520657475, now seen corresponding path program 1 times [2025-03-04 15:23:06,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:06,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139131544] [2025-03-04 15:23:06,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:06,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:06,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:23:06,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:23:06,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:06,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:06,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:06,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139131544] [2025-03-04 15:23:06,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139131544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:06,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:06,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:06,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223057422] [2025-03-04 15:23:06,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:06,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:23:06,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:06,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:23:06,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:23:06,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 117 [2025-03-04 15:23:06,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 211 flow. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:06,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:06,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 117 [2025-03-04 15:23:06,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:06,594 INFO L124 PetriNetUnfolderBase]: 869/2656 cut-off events. [2025-03-04 15:23:06,594 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 15:23:06,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4433 conditions, 2656 events. 869/2656 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 21218 event pairs, 765 based on Foata normal form. 1/2341 useless extension candidates. Maximal degree in co-relation 2238. Up to 1722 conditions per place. [2025-03-04 15:23:06,608 INFO L140 encePairwiseOnDemand]: 114/117 looper letters, 48 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2025-03-04 15:23:06,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 93 transitions, 309 flow [2025-03-04 15:23:06,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2025-03-04 15:23:06,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-03-04 15:23:06,610 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 211 flow. Second operand 3 states and 182 transitions. [2025-03-04 15:23:06,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 93 transitions, 309 flow [2025-03-04 15:23:06,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 93 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:06,613 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 209 flow [2025-03-04 15:23:06,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2025-03-04 15:23:06,614 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 1 predicate places. [2025-03-04 15:23:06,614 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 209 flow [2025-03-04 15:23:06,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:06,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:06,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:23:06,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:23:06,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:06,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:06,615 INFO L85 PathProgramCache]: Analyzing trace with hash 520656744, now seen corresponding path program 1 times [2025-03-04 15:23:06,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:06,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770822907] [2025-03-04 15:23:06,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:06,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:06,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:23:06,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:23:06,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:06,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:06,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:06,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770822907] [2025-03-04 15:23:06,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770822907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:06,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:06,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:06,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610397098] [2025-03-04 15:23:06,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:06,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:23:06,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:06,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:23:06,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:23:06,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 117 [2025-03-04 15:23:06,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:06,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:06,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 117 [2025-03-04 15:23:06,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:06,960 INFO L124 PetriNetUnfolderBase]: 869/2648 cut-off events. [2025-03-04 15:23:06,960 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 15:23:06,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4425 conditions, 2648 events. 869/2648 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 21157 event pairs, 748 based on Foata normal form. 1/2334 useless extension candidates. Maximal degree in co-relation 2230. Up to 1663 conditions per place. [2025-03-04 15:23:06,968 INFO L140 encePairwiseOnDemand]: 110/117 looper letters, 52 selfloop transitions, 7 changer transitions 8/109 dead transitions. [2025-03-04 15:23:06,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 109 transitions, 375 flow [2025-03-04 15:23:06,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:23:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:23:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 287 transitions. [2025-03-04 15:23:06,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4905982905982906 [2025-03-04 15:23:06,971 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 209 flow. Second operand 5 states and 287 transitions. [2025-03-04 15:23:06,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 109 transitions, 375 flow [2025-03-04 15:23:06,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 109 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:06,972 INFO L231 Difference]: Finished difference. Result has 97 places, 92 transitions, 217 flow [2025-03-04 15:23:06,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=97, PETRI_TRANSITIONS=92} [2025-03-04 15:23:06,973 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 2 predicate places. [2025-03-04 15:23:06,973 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 92 transitions, 217 flow [2025-03-04 15:23:06,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:06,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:06,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:06,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:23:06,974 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:06,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:06,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2090894701, now seen corresponding path program 1 times [2025-03-04 15:23:06,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:06,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721277684] [2025-03-04 15:23:06,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:06,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:06,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:23:06,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:23:06,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:06,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:07,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:07,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721277684] [2025-03-04 15:23:07,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721277684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:07,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:07,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:07,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924120934] [2025-03-04 15:23:07,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:07,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:07,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:07,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:07,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:07,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 117 [2025-03-04 15:23:07,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 92 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:07,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:07,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 117 [2025-03-04 15:23:07,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:07,316 INFO L124 PetriNetUnfolderBase]: 855/2365 cut-off events. [2025-03-04 15:23:07,316 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-04 15:23:07,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4168 conditions, 2365 events. 855/2365 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 18447 event pairs, 0 based on Foata normal form. 36/2166 useless extension candidates. Maximal degree in co-relation 2054. Up to 1602 conditions per place. [2025-03-04 15:23:07,323 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 83 selfloop transitions, 3 changer transitions 0/125 dead transitions. [2025-03-04 15:23:07,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 125 transitions, 455 flow [2025-03-04 15:23:07,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2025-03-04 15:23:07,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-04 15:23:07,327 INFO L175 Difference]: Start difference. First operand has 97 places, 92 transitions, 217 flow. Second operand 4 states and 260 transitions. [2025-03-04 15:23:07,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 125 transitions, 455 flow [2025-03-04 15:23:07,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 125 transitions, 441 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:23:07,333 INFO L231 Difference]: Finished difference. Result has 95 places, 90 transitions, 209 flow [2025-03-04 15:23:07,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=95, PETRI_TRANSITIONS=90} [2025-03-04 15:23:07,334 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 0 predicate places. [2025-03-04 15:23:07,334 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 209 flow [2025-03-04 15:23:07,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:07,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:07,336 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:07,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:23:07,336 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:07,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:07,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1667798056, now seen corresponding path program 1 times [2025-03-04 15:23:07,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:07,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475249109] [2025-03-04 15:23:07,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:07,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:07,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:23:07,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:23:07,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:07,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:23:07,360 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:23:07,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:23:07,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:23:07,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:07,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:23:07,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:23:07,383 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:23:07,384 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2025-03-04 15:23:07,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2025-03-04 15:23:07,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2025-03-04 15:23:07,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2025-03-04 15:23:07,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2025-03-04 15:23:07,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2025-03-04 15:23:07,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2025-03-04 15:23:07,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2025-03-04 15:23:07,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2025-03-04 15:23:07,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2025-03-04 15:23:07,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2025-03-04 15:23:07,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2025-03-04 15:23:07,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2025-03-04 15:23:07,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2025-03-04 15:23:07,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2025-03-04 15:23:07,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2025-03-04 15:23:07,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2025-03-04 15:23:07,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2025-03-04 15:23:07,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2025-03-04 15:23:07,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2025-03-04 15:23:07,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2025-03-04 15:23:07,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:23:07,387 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 15:23:07,389 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:23:07,389 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:23:07,414 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:23:07,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 162 transitions, 340 flow [2025-03-04 15:23:07,435 INFO L124 PetriNetUnfolderBase]: 60/276 cut-off events. [2025-03-04 15:23:07,435 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:23:07,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 276 events. 60/276 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1227 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 166. Up to 12 conditions per place. [2025-03-04 15:23:07,436 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 162 transitions, 340 flow [2025-03-04 15:23:07,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 161 transitions, 338 flow [2025-03-04 15:23:07,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:23:07,439 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;@4e0f30bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:23:07,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-04 15:23:07,442 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:23:07,442 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-04 15:23:07,442 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:23:07,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:07,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:23:07,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:23:07,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:07,443 INFO L85 PathProgramCache]: Analyzing trace with hash 21782372, now seen corresponding path program 1 times [2025-03-04 15:23:07,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:07,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702621845] [2025-03-04 15:23:07,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:07,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:07,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:23:07,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:23:07,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:07,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:07,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:07,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702621845] [2025-03-04 15:23:07,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702621845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:07,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:07,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:07,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541594901] [2025-03-04 15:23:07,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:07,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:07,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:07,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:07,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:07,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 162 [2025-03-04 15:23:07,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 161 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:07,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:07,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 162 [2025-03-04 15:23:07,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:11,584 INFO L124 PetriNetUnfolderBase]: 31927/66877 cut-off events. [2025-03-04 15:23:11,584 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-03-04 15:23:11,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114556 conditions, 66877 events. 31927/66877 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 2004. Compared 737311 event pairs, 28458 based on Foata normal form. 13069/72579 useless extension candidates. Maximal degree in co-relation 49513. Up to 24438 conditions per place. [2025-03-04 15:23:11,911 INFO L140 encePairwiseOnDemand]: 126/162 looper letters, 128 selfloop transitions, 5 changer transitions 0/193 dead transitions. [2025-03-04 15:23:11,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 193 transitions, 682 flow [2025-03-04 15:23:11,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2025-03-04 15:23:11,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6697530864197531 [2025-03-04 15:23:11,913 INFO L175 Difference]: Start difference. First operand has 130 places, 161 transitions, 338 flow. Second operand 4 states and 434 transitions. [2025-03-04 15:23:11,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 193 transitions, 682 flow [2025-03-04 15:23:11,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 193 transitions, 682 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:23:11,917 INFO L231 Difference]: Finished difference. Result has 133 places, 131 transitions, 295 flow [2025-03-04 15:23:11,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=133, PETRI_TRANSITIONS=131} [2025-03-04 15:23:11,918 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-03-04 15:23:11,918 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 131 transitions, 295 flow [2025-03-04 15:23:11,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:11,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:11,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:23:11,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:23:11,918 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:23:11,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:11,919 INFO L85 PathProgramCache]: Analyzing trace with hash 21782397, now seen corresponding path program 1 times [2025-03-04 15:23:11,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:11,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788671929] [2025-03-04 15:23:11,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:11,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:11,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:23:11,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:23:11,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:11,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:11,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:11,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:11,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788671929] [2025-03-04 15:23:11,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788671929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:11,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:11,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:11,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729814343] [2025-03-04 15:23:11,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:11,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:23:11,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:11,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:23:11,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:23:11,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 162 [2025-03-04 15:23:11,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 131 transitions, 295 flow. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:11,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:11,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 162 [2025-03-04 15:23:11,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:14,957 INFO L124 PetriNetUnfolderBase]: 31941/67149 cut-off events. [2025-03-04 15:23:14,958 INFO L125 PetriNetUnfolderBase]: For 590/590 co-relation queries the response was YES. [2025-03-04 15:23:15,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115933 conditions, 67149 events. 31941/67149 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 2006. Compared 742209 event pairs, 29104 based on Foata normal form. 1/59648 useless extension candidates. Maximal degree in co-relation 58585. Up to 47500 conditions per place. [2025-03-04 15:23:15,385 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 69 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2025-03-04 15:23:15,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 130 transitions, 435 flow [2025-03-04 15:23:15,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-03-04 15:23:15,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5164609053497943 [2025-03-04 15:23:15,388 INFO L175 Difference]: Start difference. First operand has 133 places, 131 transitions, 295 flow. Second operand 3 states and 251 transitions. [2025-03-04 15:23:15,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 130 transitions, 435 flow [2025-03-04 15:23:15,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 130 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:15,393 INFO L231 Difference]: Finished difference. Result has 132 places, 130 transitions, 292 flow [2025-03-04 15:23:15,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=132, PETRI_TRANSITIONS=130} [2025-03-04 15:23:15,395 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-03-04 15:23:15,395 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 130 transitions, 292 flow [2025-03-04 15:23:15,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:15,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:15,396 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:23:15,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:23:15,396 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:23:15,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:15,397 INFO L85 PathProgramCache]: Analyzing trace with hash 675254885, now seen corresponding path program 1 times [2025-03-04 15:23:15,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:15,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160882932] [2025-03-04 15:23:15,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:15,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:15,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:23:15,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:23:15,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:15,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:15,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:15,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160882932] [2025-03-04 15:23:15,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160882932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:15,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:15,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:15,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984079448] [2025-03-04 15:23:15,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:15,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:23:15,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:15,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:23:15,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:23:15,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 162 [2025-03-04 15:23:15,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 130 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:15,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:15,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 162 [2025-03-04 15:23:15,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:18,767 INFO L124 PetriNetUnfolderBase]: 31941/67148 cut-off events. [2025-03-04 15:23:18,767 INFO L125 PetriNetUnfolderBase]: For 590/590 co-relation queries the response was YES. [2025-03-04 15:23:18,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115570 conditions, 67148 events. 31941/67148 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 2006. Compared 742032 event pairs, 29104 based on Foata normal form. 1/59647 useless extension candidates. Maximal degree in co-relation 58598. Up to 47500 conditions per place. [2025-03-04 15:23:19,085 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 68 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2025-03-04 15:23:19,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 129 transitions, 430 flow [2025-03-04 15:23:19,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2025-03-04 15:23:19,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51440329218107 [2025-03-04 15:23:19,091 INFO L175 Difference]: Start difference. First operand has 132 places, 130 transitions, 292 flow. Second operand 3 states and 250 transitions. [2025-03-04 15:23:19,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 129 transitions, 430 flow [2025-03-04 15:23:19,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 129 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:19,094 INFO L231 Difference]: Finished difference. Result has 131 places, 129 transitions, 290 flow [2025-03-04 15:23:19,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=131, PETRI_TRANSITIONS=129} [2025-03-04 15:23:19,097 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 1 predicate places. [2025-03-04 15:23:19,098 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 290 flow [2025-03-04 15:23:19,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:19,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:19,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:23:19,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:23:19,098 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:23:19,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:19,099 INFO L85 PathProgramCache]: Analyzing trace with hash 675254154, now seen corresponding path program 1 times [2025-03-04 15:23:19,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:19,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195918495] [2025-03-04 15:23:19,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:19,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:19,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:23:19,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:23:19,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:19,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:19,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:19,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195918495] [2025-03-04 15:23:19,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195918495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:19,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:19,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:19,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812512720] [2025-03-04 15:23:19,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:19,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:23:19,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:19,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:23:19,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:23:19,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 162 [2025-03-04 15:23:19,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 129 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:19,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:19,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 162 [2025-03-04 15:23:19,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:22,129 INFO L124 PetriNetUnfolderBase]: 31927/66874 cut-off events. [2025-03-04 15:23:22,130 INFO L125 PetriNetUnfolderBase]: For 590/590 co-relation queries the response was YES. [2025-03-04 15:23:22,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115282 conditions, 66874 events. 31927/66874 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 2004. Compared 737098 event pairs, 28458 based on Foata normal form. 1/59420 useless extension candidates. Maximal degree in co-relation 58310. Up to 46091 conditions per place. [2025-03-04 15:23:22,428 INFO L140 encePairwiseOnDemand]: 155/162 looper letters, 97 selfloop transitions, 7 changer transitions 0/162 dead transitions. [2025-03-04 15:23:22,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 162 transitions, 564 flow [2025-03-04 15:23:22,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:23:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:23:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 404 transitions. [2025-03-04 15:23:22,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49876543209876545 [2025-03-04 15:23:22,433 INFO L175 Difference]: Start difference. First operand has 131 places, 129 transitions, 290 flow. Second operand 5 states and 404 transitions. [2025-03-04 15:23:22,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 162 transitions, 564 flow [2025-03-04 15:23:22,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 162 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:22,437 INFO L231 Difference]: Finished difference. Result has 132 places, 128 transitions, 298 flow [2025-03-04 15:23:22,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=298, PETRI_PLACES=132, PETRI_TRANSITIONS=128} [2025-03-04 15:23:22,439 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-03-04 15:23:22,439 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 128 transitions, 298 flow [2025-03-04 15:23:22,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:22,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:22,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:22,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:23:22,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:23:22,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:22,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1090511166, now seen corresponding path program 1 times [2025-03-04 15:23:22,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:22,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551094889] [2025-03-04 15:23:22,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:22,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:22,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:23:22,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:23:22,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:22,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:22,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:22,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551094889] [2025-03-04 15:23:22,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551094889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:22,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:22,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:22,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932822940] [2025-03-04 15:23:22,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:22,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:22,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:22,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:22,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:22,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:22,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 128 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:22,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:22,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:22,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:25,630 INFO L124 PetriNetUnfolderBase]: 34858/70183 cut-off events. [2025-03-04 15:23:25,630 INFO L125 PetriNetUnfolderBase]: For 1248/1248 co-relation queries the response was YES. [2025-03-04 15:23:25,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124089 conditions, 70183 events. 34858/70183 cut-off events. For 1248/1248 co-relation queries the response was YES. Maximal size of possible extension queue 1993. Compared 753639 event pairs, 17757 based on Foata normal form. 36/62461 useless extension candidates. Maximal degree in co-relation 59858. Up to 52150 conditions per place. [2025-03-04 15:23:25,916 INFO L140 encePairwiseOnDemand]: 156/162 looper letters, 107 selfloop transitions, 3 changer transitions 0/165 dead transitions. [2025-03-04 15:23:25,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 165 transitions, 592 flow [2025-03-04 15:23:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:25,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:25,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2025-03-04 15:23:25,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-03-04 15:23:25,918 INFO L175 Difference]: Start difference. First operand has 132 places, 128 transitions, 298 flow. Second operand 4 states and 348 transitions. [2025-03-04 15:23:25,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 165 transitions, 592 flow [2025-03-04 15:23:25,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 165 transitions, 578 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:23:25,951 INFO L231 Difference]: Finished difference. Result has 133 places, 130 transitions, 308 flow [2025-03-04 15:23:25,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=133, PETRI_TRANSITIONS=130} [2025-03-04 15:23:25,952 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-03-04 15:23:25,952 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 130 transitions, 308 flow [2025-03-04 15:23:25,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:25,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:25,953 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:25,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:23:25,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:23:25,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:25,953 INFO L85 PathProgramCache]: Analyzing trace with hash 71149887, now seen corresponding path program 1 times [2025-03-04 15:23:25,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:25,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697700232] [2025-03-04 15:23:25,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:25,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:25,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:23:25,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:23:25,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:25,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:26,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:26,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697700232] [2025-03-04 15:23:26,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697700232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:26,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:26,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:23:26,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775694857] [2025-03-04 15:23:26,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:26,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:23:26,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:26,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:23:26,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:23:26,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:26,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 130 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:26,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:26,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:26,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:29,601 INFO L124 PetriNetUnfolderBase]: 33941/66342 cut-off events. [2025-03-04 15:23:29,602 INFO L125 PetriNetUnfolderBase]: For 2896/2896 co-relation queries the response was YES. [2025-03-04 15:23:29,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120908 conditions, 66342 events. 33941/66342 cut-off events. For 2896/2896 co-relation queries the response was YES. Maximal size of possible extension queue 1956. Compared 697848 event pairs, 4820 based on Foata normal form. 648/61170 useless extension candidates. Maximal degree in co-relation 58652. Up to 41665 conditions per place. [2025-03-04 15:23:29,930 INFO L140 encePairwiseOnDemand]: 157/162 looper letters, 171 selfloop transitions, 6 changer transitions 0/232 dead transitions. [2025-03-04 15:23:29,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 232 transitions, 864 flow [2025-03-04 15:23:29,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:23:29,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:23:29,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2025-03-04 15:23:29,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2025-03-04 15:23:29,933 INFO L175 Difference]: Start difference. First operand has 133 places, 130 transitions, 308 flow. Second operand 6 states and 531 transitions. [2025-03-04 15:23:29,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 232 transitions, 864 flow [2025-03-04 15:23:29,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 232 transitions, 862 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:23:29,938 INFO L231 Difference]: Finished difference. Result has 136 places, 129 transitions, 314 flow [2025-03-04 15:23:29,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=136, PETRI_TRANSITIONS=129} [2025-03-04 15:23:29,939 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 6 predicate places. [2025-03-04 15:23:29,939 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 129 transitions, 314 flow [2025-03-04 15:23:29,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:29,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:29,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:29,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:23:29,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:23:29,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:29,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1614385315, now seen corresponding path program 1 times [2025-03-04 15:23:29,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:29,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949203763] [2025-03-04 15:23:29,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:29,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:29,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:23:29,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:23:29,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:29,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:29,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:29,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949203763] [2025-03-04 15:23:29,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949203763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:29,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:29,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:29,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993320300] [2025-03-04 15:23:29,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:29,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:29,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:29,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:29,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:30,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 162 [2025-03-04 15:23:30,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 129 transitions, 314 flow. Second operand has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:30,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:30,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 162 [2025-03-04 15:23:30,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:34,788 INFO L124 PetriNetUnfolderBase]: 46385/94447 cut-off events. [2025-03-04 15:23:34,788 INFO L125 PetriNetUnfolderBase]: For 6340/7200 co-relation queries the response was YES. [2025-03-04 15:23:34,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170674 conditions, 94447 events. 46385/94447 cut-off events. For 6340/7200 co-relation queries the response was YES. Maximal size of possible extension queue 3002. Compared 1072133 event pairs, 16289 based on Foata normal form. 1114/86800 useless extension candidates. Maximal degree in co-relation 81952. Up to 44124 conditions per place. [2025-03-04 15:23:35,281 INFO L140 encePairwiseOnDemand]: 150/162 looper letters, 207 selfloop transitions, 16 changer transitions 0/279 dead transitions. [2025-03-04 15:23:35,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 279 transitions, 1126 flow [2025-03-04 15:23:35,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:23:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:23:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 520 transitions. [2025-03-04 15:23:35,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6419753086419753 [2025-03-04 15:23:35,283 INFO L175 Difference]: Start difference. First operand has 136 places, 129 transitions, 314 flow. Second operand 5 states and 520 transitions. [2025-03-04 15:23:35,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 279 transitions, 1126 flow [2025-03-04 15:23:35,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 279 transitions, 1103 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 15:23:35,289 INFO L231 Difference]: Finished difference. Result has 140 places, 144 transitions, 430 flow [2025-03-04 15:23:35,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=430, PETRI_PLACES=140, PETRI_TRANSITIONS=144} [2025-03-04 15:23:35,290 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 10 predicate places. [2025-03-04 15:23:35,290 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 144 transitions, 430 flow [2025-03-04 15:23:35,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:35,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:35,291 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:35,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:23:35,291 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:23:35,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:35,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2075834161, now seen corresponding path program 1 times [2025-03-04 15:23:35,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:35,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063543140] [2025-03-04 15:23:35,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:35,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:35,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:23:35,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:23:35,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:35,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:35,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:35,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063543140] [2025-03-04 15:23:35,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063543140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:35,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:35,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:35,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312370343] [2025-03-04 15:23:35,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:35,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:35,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:35,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:35,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:35,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:35,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 144 transitions, 430 flow. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:35,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:35,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:35,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:40,314 INFO L124 PetriNetUnfolderBase]: 45470/87509 cut-off events. [2025-03-04 15:23:40,314 INFO L125 PetriNetUnfolderBase]: For 28704/28728 co-relation queries the response was YES. [2025-03-04 15:23:40,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180319 conditions, 87509 events. 45470/87509 cut-off events. For 28704/28728 co-relation queries the response was YES. Maximal size of possible extension queue 2863. Compared 955677 event pairs, 5179 based on Foata normal form. 858/81424 useless extension candidates. Maximal degree in co-relation 139474. Up to 62383 conditions per place. [2025-03-04 15:23:40,763 INFO L140 encePairwiseOnDemand]: 157/162 looper letters, 169 selfloop transitions, 6 changer transitions 0/230 dead transitions. [2025-03-04 15:23:40,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 230 transitions, 1058 flow [2025-03-04 15:23:40,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 376 transitions. [2025-03-04 15:23:40,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2025-03-04 15:23:40,765 INFO L175 Difference]: Start difference. First operand has 140 places, 144 transitions, 430 flow. Second operand 4 states and 376 transitions. [2025-03-04 15:23:40,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 230 transitions, 1058 flow [2025-03-04 15:23:40,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 230 transitions, 1054 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 15:23:40,856 INFO L231 Difference]: Finished difference. Result has 142 places, 144 transitions, 442 flow [2025-03-04 15:23:40,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=442, PETRI_PLACES=142, PETRI_TRANSITIONS=144} [2025-03-04 15:23:40,856 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 12 predicate places. [2025-03-04 15:23:40,856 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 144 transitions, 442 flow [2025-03-04 15:23:40,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:40,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:40,857 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:40,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:23:40,857 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:23:40,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:40,858 INFO L85 PathProgramCache]: Analyzing trace with hash 2011827123, now seen corresponding path program 1 times [2025-03-04 15:23:40,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:40,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27072618] [2025-03-04 15:23:40,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:40,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:40,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:23:40,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:23:40,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:40,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:23:40,876 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:23:40,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:23:40,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:23:40,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:40,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:23:40,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:23:40,892 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:23:40,892 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2025-03-04 15:23:40,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2025-03-04 15:23:40,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2025-03-04 15:23:40,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2025-03-04 15:23:40,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2025-03-04 15:23:40,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2025-03-04 15:23:40,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2025-03-04 15:23:40,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2025-03-04 15:23:40,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2025-03-04 15:23:40,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2025-03-04 15:23:40,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2025-03-04 15:23:40,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2025-03-04 15:23:40,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2025-03-04 15:23:40,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2025-03-04 15:23:40,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2025-03-04 15:23:40,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2025-03-04 15:23:40,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2025-03-04 15:23:40,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2025-03-04 15:23:40,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2025-03-04 15:23:40,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2025-03-04 15:23:40,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2025-03-04 15:23:40,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2025-03-04 15:23:40,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2025-03-04 15:23:40,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2025-03-04 15:23:40,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2025-03-04 15:23:40,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:23:40,894 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:40,897 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:23:40,897 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:23:40,931 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:23:40,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 207 transitions, 441 flow [2025-03-04 15:23:40,961 INFO L124 PetriNetUnfolderBase]: 87/409 cut-off events. [2025-03-04 15:23:40,962 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 15:23:40,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 409 events. 87/409 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1985 event pairs, 1 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 284. Up to 16 conditions per place. [2025-03-04 15:23:40,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 207 transitions, 441 flow [2025-03-04 15:23:40,966 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 206 transitions, 439 flow [2025-03-04 15:23:40,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:23:40,967 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;@4e0f30bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:23:40,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-04 15:23:40,968 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:23:40,968 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-04 15:23:40,968 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:23:40,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:40,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:23:40,969 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:40,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:40,969 INFO L85 PathProgramCache]: Analyzing trace with hash 28154660, now seen corresponding path program 1 times [2025-03-04 15:23:40,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:40,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955481987] [2025-03-04 15:23:40,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:40,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:40,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:23:40,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:23:40,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:40,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:40,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:40,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955481987] [2025-03-04 15:23:40,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955481987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:40,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:40,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:40,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278004253] [2025-03-04 15:23:40,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:40,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:40,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:40,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:40,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:40,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 207 [2025-03-04 15:23:40,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 206 transitions, 439 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:40,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:40,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 207 [2025-03-04 15:23:40,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand