./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_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_73-funloop_hard_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 c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:22:44,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:22:44,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:22:44,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:22:44,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:22:44,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:22:44,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:22:44,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:22:44,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:22:44,537 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:22:44,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:22:44,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:22:44,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:22:44,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:22:44,537 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:22:44,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:22:44,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:22:44,537 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:22:44,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:22:44,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:22:44,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:22:44,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:22:44,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:22:44,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:22:44,538 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:22:44,538 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:22:44,538 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:22:44,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:22:44,538 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:22:44,539 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:22:44,539 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:22:44,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:22:44,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:22:44,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:22:44,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:44,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:22:44,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:22:44,539 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:22:44,539 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:22:44,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:22:44,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:22:44,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:22:44,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:22:44,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:22:44,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:22:44,540 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 -> c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 [2025-03-04 15:22:44,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:22:44,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:22:44,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:22:44,755 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:22:44,755 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:22:44,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2025-03-04 15:22:45,848 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08afef0f5/b2b5649e279e490aa266fa1e2f48610e/FLAGf5edad693 [2025-03-04 15:22:46,153 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:22:46,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2025-03-04 15:22:46,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08afef0f5/b2b5649e279e490aa266fa1e2f48610e/FLAGf5edad693 [2025-03-04 15:22:46,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08afef0f5/b2b5649e279e490aa266fa1e2f48610e [2025-03-04 15:22:46,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:22:46,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:22:46,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:46,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:22:46,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:22:46,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:46" (1/1) ... [2025-03-04 15:22:46,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ea0041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:46, skipping insertion in model container [2025-03-04 15:22:46,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:46" (1/1) ... [2025-03-04 15:22:46,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:22:46,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:46,828 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:22:46,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:46,923 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:22:46,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:46 WrapperNode [2025-03-04 15:22:46,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:46,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:46,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:22:46,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:22:46,929 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:22:46" (1/1) ... [2025-03-04 15:22:46,942 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:22:46" (1/1) ... [2025-03-04 15:22:46,967 INFO L138 Inliner]: procedures = 272, calls = 110, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 342 [2025-03-04 15:22:46,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:46,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:22:46,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:22:46,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:22:46,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:46" (1/1) ... [2025-03-04 15:22:46,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:46" (1/1) ... [2025-03-04 15:22:46,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:46" (1/1) ... [2025-03-04 15:22:47,004 INFO L175 MemorySlicer]: Split 84 memory accesses to 4 slices as follows [2, 5, 75, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 7 writes are split as follows [0, 0, 6, 1]. [2025-03-04 15:22:47,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:46" (1/1) ... [2025-03-04 15:22:47,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:46" (1/1) ... [2025-03-04 15:22:47,014 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:46" (1/1) ... [2025-03-04 15:22:47,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:46" (1/1) ... [2025-03-04 15:22:47,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:46" (1/1) ... [2025-03-04 15:22:47,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:46" (1/1) ... [2025-03-04 15:22:47,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:22:47,023 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:22:47,023 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:22:47,023 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:22:47,024 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:46" (1/1) ... [2025-03-04 15:22:47,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:47,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:47,051 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:22:47,054 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:22:47,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:22:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:22:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:22:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:22:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:22:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:22:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:22:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:22:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:22:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:22:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:22:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:22:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:22:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:22:47,074 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:22:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:22:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:22:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:22:47,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:22:47,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:22:47,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:22:47,076 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:22:47,198 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:22:47,199 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:22:47,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L953: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 15:22:47,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 15:22:47,581 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:22:47,582 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:22:47,890 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:22:47,890 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:22:47,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:47 BoogieIcfgContainer [2025-03-04 15:22:47,890 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:22:47,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:22:47,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:22:47,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:22:47,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:22:46" (1/3) ... [2025-03-04 15:22:47,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa7ee43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:47, skipping insertion in model container [2025-03-04 15:22:47,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:46" (2/3) ... [2025-03-04 15:22:47,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa7ee43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:47, skipping insertion in model container [2025-03-04 15:22:47,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:47" (3/3) ... [2025-03-04 15:22:47,896 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2025-03-04 15:22:47,906 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:22:47,908 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_73-funloop_hard_racefree.i that has 2 procedures, 126 locations, 1 initial locations, 17 loop locations, and 22 error locations. [2025-03-04 15:22:47,908 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:22:47,949 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 15:22:47,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 163 transitions, 333 flow [2025-03-04 15:22:48,026 INFO L124 PetriNetUnfolderBase]: 60/257 cut-off events. [2025-03-04 15:22:48,028 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:22:48,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 257 events. 60/257 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1289 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 148. Up to 8 conditions per place. [2025-03-04 15:22:48,034 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 163 transitions, 333 flow [2025-03-04 15:22:48,043 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 162 transitions, 331 flow [2025-03-04 15:22:48,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:48,060 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;@6c484dd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:48,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-04 15:22:48,065 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:48,065 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:22:48,065 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:48,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:48,066 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:22:48,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:22:48,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:48,071 INFO L85 PathProgramCache]: Analyzing trace with hash 838164, now seen corresponding path program 1 times [2025-03-04 15:22:48,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:48,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713614723] [2025-03-04 15:22:48,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:48,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:48,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:22:48,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:22:48,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:48,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:48,344 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:22:48,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:48,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713614723] [2025-03-04 15:22:48,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713614723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:48,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:48,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:48,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420518463] [2025-03-04 15:22:48,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:48,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:48,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:48,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:48,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:48,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 163 [2025-03-04 15:22:48,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 162 transitions, 331 flow. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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:22:48,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:48,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 163 [2025-03-04 15:22:48,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:48,897 INFO L124 PetriNetUnfolderBase]: 949/2922 cut-off events. [2025-03-04 15:22:48,899 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:22:48,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4736 conditions, 2922 events. 949/2922 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 23724 event pairs, 800 based on Foata normal form. 442/2977 useless extension candidates. Maximal degree in co-relation 4589. Up to 1807 conditions per place. [2025-03-04 15:22:48,922 INFO L140 encePairwiseOnDemand]: 127/163 looper letters, 69 selfloop transitions, 3 changer transitions 0/134 dead transitions. [2025-03-04 15:22:48,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 134 transitions, 419 flow [2025-03-04 15:22:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 353 transitions. [2025-03-04 15:22:48,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5414110429447853 [2025-03-04 15:22:48,937 INFO L175 Difference]: Start difference. First operand has 129 places, 162 transitions, 331 flow. Second operand 4 states and 353 transitions. [2025-03-04 15:22:48,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 134 transitions, 419 flow [2025-03-04 15:22:48,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 134 transitions, 419 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:48,946 INFO L231 Difference]: Finished difference. Result has 134 places, 134 transitions, 295 flow [2025-03-04 15:22:48,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=134, PETRI_TRANSITIONS=134} [2025-03-04 15:22:48,951 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 5 predicate places. [2025-03-04 15:22:48,951 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 134 transitions, 295 flow [2025-03-04 15:22:48,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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:22:48,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:48,951 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:22:48,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:22:48,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:22:48,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:48,952 INFO L85 PathProgramCache]: Analyzing trace with hash -799385258, now seen corresponding path program 1 times [2025-03-04 15:22:48,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:48,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044902812] [2025-03-04 15:22:48,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:48,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:48,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:48,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:48,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:48,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:49,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:49,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044902812] [2025-03-04 15:22:49,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044902812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:49,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559645460] [2025-03-04 15:22:49,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:49,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:49,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:49,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:22:49,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:22:49,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:49,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:49,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:49,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:49,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:22:49,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:49,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:22:49,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559645460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:49,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:22:49,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:22:49,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777250840] [2025-03-04 15:22:49,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:49,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:49,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:49,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:49,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:22:49,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 163 [2025-03-04 15:22:49,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 134 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 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:22:49,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:49,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 163 [2025-03-04 15:22:49,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:49,715 INFO L124 PetriNetUnfolderBase]: 949/2921 cut-off events. [2025-03-04 15:22:49,716 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:22:49,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4746 conditions, 2921 events. 949/2921 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 23673 event pairs, 800 based on Foata normal form. 1/2535 useless extension candidates. Maximal degree in co-relation 4728. Up to 1802 conditions per place. [2025-03-04 15:22:49,724 INFO L140 encePairwiseOnDemand]: 158/163 looper letters, 65 selfloop transitions, 6 changer transitions 0/133 dead transitions. [2025-03-04 15:22:49,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 133 transitions, 433 flow [2025-03-04 15:22:49,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:22:49,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:22:49,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 444 transitions. [2025-03-04 15:22:49,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4539877300613497 [2025-03-04 15:22:49,727 INFO L175 Difference]: Start difference. First operand has 134 places, 134 transitions, 295 flow. Second operand 6 states and 444 transitions. [2025-03-04 15:22:49,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 133 transitions, 433 flow [2025-03-04 15:22:49,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 133 transitions, 431 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:49,729 INFO L231 Difference]: Finished difference. Result has 137 places, 133 transitions, 301 flow [2025-03-04 15:22:49,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=137, PETRI_TRANSITIONS=133} [2025-03-04 15:22:49,730 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 8 predicate places. [2025-03-04 15:22:49,730 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 133 transitions, 301 flow [2025-03-04 15:22:49,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 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:22:49,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:49,730 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:22:49,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:22:49,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:49,935 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:22:49,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash 988861455, now seen corresponding path program 1 times [2025-03-04 15:22:49,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:49,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477325868] [2025-03-04 15:22:49,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:49,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:49,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:22:49,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:22:49,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:49,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:22:49,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:49,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477325868] [2025-03-04 15:22:49,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477325868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:49,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:49,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:49,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729431542] [2025-03-04 15:22:49,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:49,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:22:49,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:49,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:22:49,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:22:49,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 163 [2025-03-04 15:22:49,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 133 transitions, 301 flow. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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:22:49,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:49,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 163 [2025-03-04 15:22:49,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:50,223 INFO L124 PetriNetUnfolderBase]: 949/2920 cut-off events. [2025-03-04 15:22:50,223 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 15:22:50,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4748 conditions, 2920 events. 949/2920 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 23675 event pairs, 800 based on Foata normal form. 1/2535 useless extension candidates. Maximal degree in co-relation 4724. Up to 1805 conditions per place. [2025-03-04 15:22:50,234 INFO L140 encePairwiseOnDemand]: 160/163 looper letters, 66 selfloop transitions, 4 changer transitions 0/132 dead transitions. [2025-03-04 15:22:50,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 132 transitions, 437 flow [2025-03-04 15:22:50,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:22:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:22:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2025-03-04 15:22:50,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5214723926380368 [2025-03-04 15:22:50,236 INFO L175 Difference]: Start difference. First operand has 137 places, 133 transitions, 301 flow. Second operand 3 states and 255 transitions. [2025-03-04 15:22:50,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 132 transitions, 437 flow [2025-03-04 15:22:50,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 132 transitions, 415 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:22:50,238 INFO L231 Difference]: Finished difference. Result has 132 places, 132 transitions, 283 flow [2025-03-04 15:22:50,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=283, PETRI_PLACES=132, PETRI_TRANSITIONS=132} [2025-03-04 15:22:50,239 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 3 predicate places. [2025-03-04 15:22:50,239 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 132 transitions, 283 flow [2025-03-04 15:22:50,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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:22:50,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:50,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:50,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:22:50,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:22:50,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:50,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1106135721, now seen corresponding path program 1 times [2025-03-04 15:22:50,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:50,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607673790] [2025-03-04 15:22:50,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:50,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:50,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:50,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:50,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:50,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:50,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:50,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607673790] [2025-03-04 15:22:50,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607673790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:50,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522322949] [2025-03-04 15:22:50,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:50,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:50,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:50,333 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:22:50,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:22:50,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:50,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:50,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:50,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:50,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:22:50,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:50,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:22:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:50,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522322949] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:22:50,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:22:50,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:22:50,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949321833] [2025-03-04 15:22:50,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:22:50,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:22:50,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:50,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:22:50,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:22:50,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 163 [2025-03-04 15:22:50,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 132 transitions, 283 flow. Second operand has 10 states, 10 states have (on average 63.3) internal successors, (633), 10 states have internal predecessors, (633), 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:22:50,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:50,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 163 [2025-03-04 15:22:50,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:50,840 INFO L124 PetriNetUnfolderBase]: 949/2924 cut-off events. [2025-03-04 15:22:50,841 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 15:22:50,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4751 conditions, 2924 events. 949/2924 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 23677 event pairs, 800 based on Foata normal form. 2/2541 useless extension candidates. Maximal degree in co-relation 4717. Up to 1803 conditions per place. [2025-03-04 15:22:50,856 INFO L140 encePairwiseOnDemand]: 159/163 looper letters, 66 selfloop transitions, 7 changer transitions 0/135 dead transitions. [2025-03-04 15:22:50,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 135 transitions, 444 flow [2025-03-04 15:22:50,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:22:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:22:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 509 transitions. [2025-03-04 15:22:50,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44609991235758106 [2025-03-04 15:22:50,858 INFO L175 Difference]: Start difference. First operand has 132 places, 132 transitions, 283 flow. Second operand 7 states and 509 transitions. [2025-03-04 15:22:50,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 135 transitions, 444 flow [2025-03-04 15:22:50,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 135 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:22:50,864 INFO L231 Difference]: Finished difference. Result has 138 places, 135 transitions, 309 flow [2025-03-04 15:22:50,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=309, PETRI_PLACES=138, PETRI_TRANSITIONS=135} [2025-03-04 15:22:50,864 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 9 predicate places. [2025-03-04 15:22:50,864 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 135 transitions, 309 flow [2025-03-04 15:22:50,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 63.3) internal successors, (633), 10 states have internal predecessors, (633), 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:22:50,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:50,865 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:50,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:22:51,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 15:22:51,066 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:22:51,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1516395369, now seen corresponding path program 2 times [2025-03-04 15:22:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:51,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735400404] [2025-03-04 15:22:51,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:22:51,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:51,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:22:51,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-04 15:22:51,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:22:51,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:22:51,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:51,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735400404] [2025-03-04 15:22:51,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735400404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:51,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:51,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:22:51,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047900391] [2025-03-04 15:22:51,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:51,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:51,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:51,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:51,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:51,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 163 [2025-03-04 15:22:51,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 135 transitions, 309 flow. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 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:22:51,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:51,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 163 [2025-03-04 15:22:51,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:51,440 INFO L124 PetriNetUnfolderBase]: 927/2557 cut-off events. [2025-03-04 15:22:51,440 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 15:22:51,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4358 conditions, 2557 events. 927/2557 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 19602 event pairs, 0 based on Foata normal form. 21/2301 useless extension candidates. Maximal degree in co-relation 4319. Up to 1711 conditions per place. [2025-03-04 15:22:51,450 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 114 selfloop transitions, 3 changer transitions 0/176 dead transitions. [2025-03-04 15:22:51,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 176 transitions, 625 flow [2025-03-04 15:22:51,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-04 15:22:51,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5506134969325154 [2025-03-04 15:22:51,454 INFO L175 Difference]: Start difference. First operand has 138 places, 135 transitions, 309 flow. Second operand 4 states and 359 transitions. [2025-03-04 15:22:51,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 176 transitions, 625 flow [2025-03-04 15:22:51,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 176 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:22:51,459 INFO L231 Difference]: Finished difference. Result has 138 places, 133 transitions, 311 flow [2025-03-04 15:22:51,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=311, PETRI_PLACES=138, PETRI_TRANSITIONS=133} [2025-03-04 15:22:51,459 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 9 predicate places. [2025-03-04 15:22:51,460 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 133 transitions, 311 flow [2025-03-04 15:22:51,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 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:22:51,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:51,460 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:51,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:22:51,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:22:51,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:51,462 INFO L85 PathProgramCache]: Analyzing trace with hash 469169203, now seen corresponding path program 1 times [2025-03-04 15:22:51,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:51,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258991962] [2025-03-04 15:22:51,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:51,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:51,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:22:51,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:22:51,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:51,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:51,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:51,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258991962] [2025-03-04 15:22:51,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258991962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:51,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843110383] [2025-03-04 15:22:51,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:51,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:51,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:51,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:22:51,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:22:51,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:22:51,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:22:51,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:51,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:51,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:22:51,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:51,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:22:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:51,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843110383] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:22:51,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:22:51,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:22:51,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903356236] [2025-03-04 15:22:51,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:22:51,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:22:51,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:51,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:22:51,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:22:51,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 163 [2025-03-04 15:22:51,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 133 transitions, 311 flow. Second operand has 18 states, 18 states have (on average 63.22222222222222) internal successors, (1138), 18 states have internal predecessors, (1138), 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:22:51,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:51,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 163 [2025-03-04 15:22:51,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:52,196 INFO L124 PetriNetUnfolderBase]: 946/2800 cut-off events. [2025-03-04 15:22:52,196 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-03-04 15:22:52,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4668 conditions, 2800 events. 946/2800 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 22159 event pairs, 800 based on Foata normal form. 4/2455 useless extension candidates. Maximal degree in co-relation 4593. Up to 1768 conditions per place. [2025-03-04 15:22:52,206 INFO L140 encePairwiseOnDemand]: 159/163 looper letters, 66 selfloop transitions, 15 changer transitions 0/141 dead transitions. [2025-03-04 15:22:52,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 141 transitions, 521 flow [2025-03-04 15:22:52,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:22:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:22:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1015 transitions. [2025-03-04 15:22:52,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41513292433537835 [2025-03-04 15:22:52,209 INFO L175 Difference]: Start difference. First operand has 138 places, 133 transitions, 311 flow. Second operand 15 states and 1015 transitions. [2025-03-04 15:22:52,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 141 transitions, 521 flow [2025-03-04 15:22:52,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 141 transitions, 515 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:22:52,212 INFO L231 Difference]: Finished difference. Result has 153 places, 141 transitions, 402 flow [2025-03-04 15:22:52,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=402, PETRI_PLACES=153, PETRI_TRANSITIONS=141} [2025-03-04 15:22:52,213 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 24 predicate places. [2025-03-04 15:22:52,213 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 141 transitions, 402 flow [2025-03-04 15:22:52,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 63.22222222222222) internal successors, (1138), 18 states have internal predecessors, (1138), 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:22:52,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:52,214 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:52,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:22:52,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:52,418 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:22:52,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:52,418 INFO L85 PathProgramCache]: Analyzing trace with hash -797306189, now seen corresponding path program 2 times [2025-03-04 15:22:52,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:52,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23325746] [2025-03-04 15:22:52,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:22:52,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:52,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:22:52,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:22:52,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:22:52,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:52,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:52,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23325746] [2025-03-04 15:22:52,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23325746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:52,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031976449] [2025-03-04 15:22:52,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:22:52,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:52,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:52,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:22:52,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:22:52,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:22:52,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:22:52,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:22:52,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:52,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:22:52,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:52,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:22:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:52,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031976449] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:22:52,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:22:52,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-03-04 15:22:52,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215540477] [2025-03-04 15:22:52,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:22:52,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:22:52,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:52,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:22:52,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:22:52,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 163 [2025-03-04 15:22:52,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 141 transitions, 402 flow. Second operand has 23 states, 23 states have (on average 63.21739130434783) internal successors, (1454), 23 states have internal predecessors, (1454), 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:22:52,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:52,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 163 [2025-03-04 15:22:52,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:53,421 INFO L124 PetriNetUnfolderBase]: 946/2809 cut-off events. [2025-03-04 15:22:53,421 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-03-04 15:22:53,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4709 conditions, 2809 events. 946/2809 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 22165 event pairs, 800 based on Foata normal form. 3/2463 useless extension candidates. Maximal degree in co-relation 4574. Up to 1768 conditions per place. [2025-03-04 15:22:53,439 INFO L140 encePairwiseOnDemand]: 159/163 looper letters, 66 selfloop transitions, 21 changer transitions 0/147 dead transitions. [2025-03-04 15:22:53,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 147 transitions, 630 flow [2025-03-04 15:22:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:22:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 15:22:53,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1392 transitions. [2025-03-04 15:22:53,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.406660823838738 [2025-03-04 15:22:53,442 INFO L175 Difference]: Start difference. First operand has 153 places, 141 transitions, 402 flow. Second operand 21 states and 1392 transitions. [2025-03-04 15:22:53,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 147 transitions, 630 flow [2025-03-04 15:22:53,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 147 transitions, 620 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:22:53,447 INFO L231 Difference]: Finished difference. Result has 172 places, 147 transitions, 503 flow [2025-03-04 15:22:53,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=503, PETRI_PLACES=172, PETRI_TRANSITIONS=147} [2025-03-04 15:22:53,448 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 43 predicate places. [2025-03-04 15:22:53,448 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 147 transitions, 503 flow [2025-03-04 15:22:53,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 63.21739130434783) internal successors, (1454), 23 states have internal predecessors, (1454), 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:22:53,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:53,449 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:53,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:22:53,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:53,650 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:22:53,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:53,650 INFO L85 PathProgramCache]: Analyzing trace with hash 915200753, now seen corresponding path program 3 times [2025-03-04 15:22:53,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:53,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499994833] [2025-03-04 15:22:53,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:22:53,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:53,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 11 equivalence classes. [2025-03-04 15:22:53,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:22:53,699 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 15:22:53,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:53,699 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:22:53,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:22:53,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:22:53,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:53,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:53,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:22:53,738 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:22:53,739 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-03-04 15:22:53,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 29 remaining) [2025-03-04 15:22:53,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 29 remaining) [2025-03-04 15:22:53,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 29 remaining) [2025-03-04 15:22:53,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 29 remaining) [2025-03-04 15:22:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 29 remaining) [2025-03-04 15:22:53,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:22:53,742 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2025-03-04 15:22:53,743 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:22:53,743 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:22:53,775 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:22:53,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 214 transitions, 444 flow [2025-03-04 15:22:53,798 INFO L124 PetriNetUnfolderBase]: 97/421 cut-off events. [2025-03-04 15:22:53,798 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:22:53,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 421 events. 97/421 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2358 event pairs, 0 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 259. Up to 12 conditions per place. [2025-03-04 15:22:53,800 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 214 transitions, 444 flow [2025-03-04 15:22:53,804 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 214 transitions, 444 flow [2025-03-04 15:22:53,804 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:53,805 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;@6c484dd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:53,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-03-04 15:22:53,807 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:53,808 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:22:53,808 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:53,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:53,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:22:53,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2025-03-04 15:22:53,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:53,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1050666, now seen corresponding path program 1 times [2025-03-04 15:22:53,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:53,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234872216] [2025-03-04 15:22:53,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:53,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:53,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:22:53,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:22:53,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:53,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:53,843 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:22:53,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:53,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234872216] [2025-03-04 15:22:53,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234872216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:53,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:53,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:53,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828875777] [2025-03-04 15:22:53,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:53,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:53,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:53,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:53,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:53,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 214 [2025-03-04 15:22:53,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 214 transitions, 444 flow. Second operand has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 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:22:53,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:53,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 214 [2025-03-04 15:22:53,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:58,165 INFO L124 PetriNetUnfolderBase]: 39869/85575 cut-off events. [2025-03-04 15:22:58,165 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-03-04 15:22:58,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143697 conditions, 85575 events. 39869/85575 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 2462. Compared 978668 event pairs, 34920 based on Foata normal form. 14318/88694 useless extension candidates. Maximal degree in co-relation 107164. Up to 58008 conditions per place. [2025-03-04 15:22:58,633 INFO L140 encePairwiseOnDemand]: 168/214 looper letters, 93 selfloop transitions, 3 changer transitions 0/176 dead transitions. [2025-03-04 15:22:58,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 176 transitions, 560 flow [2025-03-04 15:22:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2025-03-04 15:22:58,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5362149532710281 [2025-03-04 15:22:58,636 INFO L175 Difference]: Start difference. First operand has 169 places, 214 transitions, 444 flow. Second operand 4 states and 459 transitions. [2025-03-04 15:22:58,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 176 transitions, 560 flow [2025-03-04 15:22:58,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 176 transitions, 560 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:58,640 INFO L231 Difference]: Finished difference. Result has 174 places, 176 transitions, 388 flow [2025-03-04 15:22:58,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=388, PETRI_PLACES=174, PETRI_TRANSITIONS=176} [2025-03-04 15:22:58,643 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 5 predicate places. [2025-03-04 15:22:58,644 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 176 transitions, 388 flow [2025-03-04 15:22:58,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 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:22:58,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:58,645 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:22:58,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:22:58,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2025-03-04 15:22:58,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:58,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1236507030, now seen corresponding path program 1 times [2025-03-04 15:22:58,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:58,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26807020] [2025-03-04 15:22:58,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:58,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:58,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:58,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:58,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:58,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:58,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:58,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26807020] [2025-03-04 15:22:58,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26807020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:58,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477300346] [2025-03-04 15:22:58,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:58,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:58,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:58,714 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:22:58,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:22:58,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:58,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:58,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:58,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:58,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:22:58,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:58,809 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:22:58,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477300346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:58,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:22:58,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:22:58,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425954241] [2025-03-04 15:22:58,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:58,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:58,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:58,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:58,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:22:58,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 214 [2025-03-04 15:22:58,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 176 transitions, 388 flow. Second operand has 6 states, 6 states have (on average 80.83333333333333) internal successors, (485), 6 states have internal predecessors, (485), 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:22:58,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:58,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 214 [2025-03-04 15:22:58,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:03,332 INFO L124 PetriNetUnfolderBase]: 39869/85574 cut-off events. [2025-03-04 15:23:03,333 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2025-03-04 15:23:03,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143707 conditions, 85574 events. 39869/85574 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 2463. Compared 978666 event pairs, 34920 based on Foata normal form. 1/74376 useless extension candidates. Maximal degree in co-relation 143688. Up to 58003 conditions per place. [2025-03-04 15:23:03,720 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 89 selfloop transitions, 6 changer transitions 0/175 dead transitions. [2025-03-04 15:23:03,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 175 transitions, 574 flow [2025-03-04 15:23:03,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:23:03,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:23:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 576 transitions. [2025-03-04 15:23:03,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4485981308411215 [2025-03-04 15:23:03,722 INFO L175 Difference]: Start difference. First operand has 174 places, 176 transitions, 388 flow. Second operand 6 states and 576 transitions. [2025-03-04 15:23:03,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 175 transitions, 574 flow [2025-03-04 15:23:03,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 175 transitions, 572 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:23:03,725 INFO L231 Difference]: Finished difference. Result has 177 places, 175 transitions, 394 flow [2025-03-04 15:23:03,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=177, PETRI_TRANSITIONS=175} [2025-03-04 15:23:03,726 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 8 predicate places. [2025-03-04 15:23:03,726 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 175 transitions, 394 flow [2025-03-04 15:23:03,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.83333333333333) internal successors, (485), 6 states have internal predecessors, (485), 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:03,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:03,726 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:23:03,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:23:03,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 15:23:03,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2025-03-04 15:23:03,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:03,927 INFO L85 PathProgramCache]: Analyzing trace with hash -322986843, now seen corresponding path program 1 times [2025-03-04 15:23:03,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:03,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730161486] [2025-03-04 15:23:03,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:03,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:03,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:23:03,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:23:03,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:03,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:23:03,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:03,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730161486] [2025-03-04 15:23:03,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730161486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:03,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:03,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:03,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375658111] [2025-03-04 15:23:03,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:03,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:23:03,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:03,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:23:03,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:23:03,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 214 [2025-03-04 15:23:03,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 175 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 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:03,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:03,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 214 [2025-03-04 15:23:03,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:08,364 INFO L124 PetriNetUnfolderBase]: 39869/85573 cut-off events. [2025-03-04 15:23:08,364 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2025-03-04 15:23:08,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143709 conditions, 85573 events. 39869/85573 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 2468. Compared 978632 event pairs, 34920 based on Foata normal form. 1/74376 useless extension candidates. Maximal degree in co-relation 143684. Up to 58006 conditions per place. [2025-03-04 15:23:08,741 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 90 selfloop transitions, 4 changer transitions 0/174 dead transitions. [2025-03-04 15:23:08,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 174 transitions, 578 flow [2025-03-04 15:23:08,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:08,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2025-03-04 15:23:08,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5186915887850467 [2025-03-04 15:23:08,742 INFO L175 Difference]: Start difference. First operand has 177 places, 175 transitions, 394 flow. Second operand 3 states and 333 transitions. [2025-03-04 15:23:08,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 174 transitions, 578 flow [2025-03-04 15:23:08,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 174 transitions, 556 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:23:08,746 INFO L231 Difference]: Finished difference. Result has 172 places, 174 transitions, 376 flow [2025-03-04 15:23:08,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=172, PETRI_TRANSITIONS=174} [2025-03-04 15:23:08,747 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 3 predicate places. [2025-03-04 15:23:08,747 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 174 transitions, 376 flow [2025-03-04 15:23:08,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 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:08,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:08,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:08,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:23:08,747 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2025-03-04 15:23:08,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:08,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1154606992, now seen corresponding path program 1 times [2025-03-04 15:23:08,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:08,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510239465] [2025-03-04 15:23:08,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:08,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:08,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:23:08,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:23:08,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:08,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:08,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:08,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510239465] [2025-03-04 15:23:08,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510239465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:08,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369115029] [2025-03-04 15:23:08,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:08,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:08,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:08,797 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:23:08,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:23:08,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:23:08,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:23:08,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:08,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:08,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:23:08,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:08,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:08,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:08,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369115029] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:08,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:08,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:23:08,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167245038] [2025-03-04 15:23:08,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:08,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:23:08,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:08,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:23:08,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:23:08,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 214 [2025-03-04 15:23:08,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 174 transitions, 376 flow. Second operand has 10 states, 10 states have (on average 81.3) internal successors, (813), 10 states have internal predecessors, (813), 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:08,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:08,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 214 [2025-03-04 15:23:08,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:13,188 INFO L124 PetriNetUnfolderBase]: 39869/85577 cut-off events. [2025-03-04 15:23:13,188 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2025-03-04 15:23:13,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143712 conditions, 85577 events. 39869/85577 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 2468. Compared 978569 event pairs, 34920 based on Foata normal form. 2/74382 useless extension candidates. Maximal degree in co-relation 143677. Up to 58004 conditions per place. [2025-03-04 15:23:13,551 INFO L140 encePairwiseOnDemand]: 210/214 looper letters, 90 selfloop transitions, 7 changer transitions 0/177 dead transitions. [2025-03-04 15:23:13,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 177 transitions, 585 flow [2025-03-04 15:23:13,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:23:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:23:13,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 659 transitions. [2025-03-04 15:23:13,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43991989319092123 [2025-03-04 15:23:13,553 INFO L175 Difference]: Start difference. First operand has 172 places, 174 transitions, 376 flow. Second operand 7 states and 659 transitions. [2025-03-04 15:23:13,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 177 transitions, 585 flow [2025-03-04 15:23:13,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 177 transitions, 571 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:13,556 INFO L231 Difference]: Finished difference. Result has 178 places, 177 transitions, 402 flow [2025-03-04 15:23:13,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=178, PETRI_TRANSITIONS=177} [2025-03-04 15:23:13,557 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 9 predicate places. [2025-03-04 15:23:13,557 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 177 transitions, 402 flow [2025-03-04 15:23:13,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.3) internal successors, (813), 10 states have internal predecessors, (813), 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:13,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:13,557 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:13,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:23:13,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:13,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2025-03-04 15:23:13,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:13,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1024274672, now seen corresponding path program 2 times [2025-03-04 15:23:13,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:13,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177937208] [2025-03-04 15:23:13,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:23:13,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:13,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:23:13,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-04 15:23:13,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:23:13,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:23:13,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:13,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177937208] [2025-03-04 15:23:13,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177937208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:13,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:13,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:13,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995114177] [2025-03-04 15:23:13,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:13,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:13,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:13,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:13,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:13,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 214 [2025-03-04 15:23:13,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 177 transitions, 402 flow. Second operand has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 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:13,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:13,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 214 [2025-03-04 15:23:13,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:18,338 INFO L124 PetriNetUnfolderBase]: 41693/85653 cut-off events. [2025-03-04 15:23:18,338 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-03-04 15:23:18,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146789 conditions, 85653 events. 41693/85653 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 2324. Compared 944194 event pairs, 18140 based on Foata normal form. 21/74906 useless extension candidates. Maximal degree in co-relation 146749. Up to 60939 conditions per place. [2025-03-04 15:23:18,719 INFO L140 encePairwiseOnDemand]: 208/214 looper letters, 142 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2025-03-04 15:23:18,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 222 transitions, 782 flow [2025-03-04 15:23:18,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2025-03-04 15:23:18,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5362149532710281 [2025-03-04 15:23:18,721 INFO L175 Difference]: Start difference. First operand has 178 places, 177 transitions, 402 flow. Second operand 4 states and 459 transitions. [2025-03-04 15:23:18,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 222 transitions, 782 flow [2025-03-04 15:23:18,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 222 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:18,724 INFO L231 Difference]: Finished difference. Result has 181 places, 179 transitions, 422 flow [2025-03-04 15:23:18,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=422, PETRI_PLACES=181, PETRI_TRANSITIONS=179} [2025-03-04 15:23:18,724 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 12 predicate places. [2025-03-04 15:23:18,725 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 179 transitions, 422 flow [2025-03-04 15:23:18,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 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:18,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:18,725 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:18,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:23:18,725 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2025-03-04 15:23:18,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:18,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1670873548, now seen corresponding path program 1 times [2025-03-04 15:23:18,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:18,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323224183] [2025-03-04 15:23:18,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:18,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:18,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:23:18,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:23:18,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:18,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:18,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:18,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323224183] [2025-03-04 15:23:18,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323224183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:18,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720243231] [2025-03-04 15:23:18,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:18,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:18,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:18,823 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:23:18,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:23:18,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:23:18,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:23:18,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:18,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:18,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:23:18,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:18,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:18,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720243231] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:18,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:18,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:23:18,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457405780] [2025-03-04 15:23:18,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:18,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:23:18,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:18,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:23:18,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:23:19,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 214 [2025-03-04 15:23:19,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 179 transitions, 422 flow. Second operand has 18 states, 18 states have (on average 81.27777777777777) internal successors, (1463), 18 states have internal predecessors, (1463), 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,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:19,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 214 [2025-03-04 15:23:19,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand