./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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_78-equ_racing.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 246cd07a930f0cb8d777c2eae74f25d04e3267c275b813f0c0f5232c23299340 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:39:15,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:39:15,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:39:15,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:39:15,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:39:15,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:39:15,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:39:15,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:39:15,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:39:15,999 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:39:15,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:39:15,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:39:15,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:39:15,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:39:16,000 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:39:16,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:39:16,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:39:16,000 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:39:16,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:39:16,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:39:16,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:39:16,000 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:39:16,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:39:16,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:39:16,001 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:39:16,001 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:39:16,001 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:39:16,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:39:16,001 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:39:16,001 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:39:16,001 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:39:16,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:39:16,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:39:16,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:39:16,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:39:16,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:39:16,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:39:16,002 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:39:16,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:39:16,002 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:39:16,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:39:16,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:39:16,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:39:16,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:39:16,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:39:16,002 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 -> 246cd07a930f0cb8d777c2eae74f25d04e3267c275b813f0c0f5232c23299340 [2025-03-17 19:39:16,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:39:16,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:39:16,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:39:16,254 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:39:16,254 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:39:16,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2025-03-17 19:39:17,485 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a367f79a9/265478075a8b4180bf2d6f3f04d3287c/FLAG46d5580be [2025-03-17 19:39:17,817 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:39:17,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2025-03-17 19:39:17,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a367f79a9/265478075a8b4180bf2d6f3f04d3287c/FLAG46d5580be [2025-03-17 19:39:17,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a367f79a9/265478075a8b4180bf2d6f3f04d3287c [2025-03-17 19:39:17,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:39:17,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:39:17,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:39:17,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:39:17,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:39:17,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:39:17" (1/1) ... [2025-03-17 19:39:17,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a47042a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:39:17, skipping insertion in model container [2025-03-17 19:39:17,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:39:17" (1/1) ... [2025-03-17 19:39:17,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:39:18,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:39:18,202 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:39:18,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:39:18,308 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:39:18,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:39:18 WrapperNode [2025-03-17 19:39:18,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:39:18,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:39:18,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:39:18,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:39:18,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:39:18" (1/1) ... [2025-03-17 19:39:18,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:39:18" (1/1) ... [2025-03-17 19:39:18,344 INFO L138 Inliner]: procedures = 272, calls = 65, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 230 [2025-03-17 19:39:18,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:39:18,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:39:18,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:39:18,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:39:18,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:39:18" (1/1) ... [2025-03-17 19:39:18,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:39:18" (1/1) ... [2025-03-17 19:39:18,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:39:18" (1/1) ... [2025-03-17 19:39:18,369 INFO L175 MemorySlicer]: Split 35 memory accesses to 4 slices as follows [2, 5, 26, 2]. 74 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [2, 5, 16, 0]. The 5 writes are split as follows [0, 0, 4, 1]. [2025-03-17 19:39:18,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:39:18" (1/1) ... [2025-03-17 19:39:18,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:39:18" (1/1) ... [2025-03-17 19:39:18,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:39:18" (1/1) ... [2025-03-17 19:39:18,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:39:18" (1/1) ... [2025-03-17 19:39:18,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:39:18" (1/1) ... [2025-03-17 19:39:18,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:39:18" (1/1) ... [2025-03-17 19:39:18,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:39:18,381 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:39:18,381 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:39:18,381 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:39:18,382 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:39:18" (1/1) ... [2025-03-17 19:39:18,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:39:18,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:39:18,411 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-17 19:39:18,420 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-17 19:39:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:39:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:39:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 19:39:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:39:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:39:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:39:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 19:39:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:39:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:39:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:39:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 19:39:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 19:39:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:39:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 19:39:18,436 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 19:39:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:39:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:39:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 19:39:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 19:39:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:39:18,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:39:18,438 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 19:39:18,558 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:39:18,560 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:39:18,832 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-17 19:39:18,832 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-17 19:39:18,906 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 19:39:18,907 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:39:19,051 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:39:19,051 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:39:19,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:39:19 BoogieIcfgContainer [2025-03-17 19:39:19,051 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:39:19,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:39:19,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:39:19,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:39:19,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:39:17" (1/3) ... [2025-03-17 19:39:19,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405ba258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:39:19, skipping insertion in model container [2025-03-17 19:39:19,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:39:18" (2/3) ... [2025-03-17 19:39:19,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405ba258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:39:19, skipping insertion in model container [2025-03-17 19:39:19,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:39:19" (3/3) ... [2025-03-17 19:39:19,062 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_78-equ_racing.i [2025-03-17 19:39:19,075 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:39:19,076 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_78-equ_racing.i that has 2 procedures, 92 locations, 1 initial locations, 10 loop locations, and 16 error locations. [2025-03-17 19:39:19,076 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 19:39:19,118 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 19:39:19,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 117 transitions, 241 flow [2025-03-17 19:39:19,187 INFO L124 PetriNetUnfolderBase]: 36/164 cut-off events. [2025-03-17 19:39:19,189 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:39:19,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 164 events. 36/164 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 621 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 95. Up to 8 conditions per place. [2025-03-17 19:39:19,193 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 117 transitions, 241 flow [2025-03-17 19:39:19,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 115 transitions, 237 flow [2025-03-17 19:39:19,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:39:19,214 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;@3685b984, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:39:19,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-17 19:39:19,219 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:39:19,219 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-17 19:39:19,219 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:39:19,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:39:19,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:39:19,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-17 19:39:19,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:39:19,225 INFO L85 PathProgramCache]: Analyzing trace with hash 16855937, now seen corresponding path program 1 times [2025-03-17 19:39:19,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:39:19,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288685980] [2025-03-17 19:39:19,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:39:19,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:39:19,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:39:19,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:39:19,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:39:19,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:39:19,430 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-17 19:39:19,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:39:19,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288685980] [2025-03-17 19:39:19,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288685980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:39:19,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:39:19,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:39:19,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134616179] [2025-03-17 19:39:19,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:39:19,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:39:19,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:39:19,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:39:19,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:39:19,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 117 [2025-03-17 19:39:19,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 115 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:19,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:39:19,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 117 [2025-03-17 19:39:19,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:39:19,990 INFO L124 PetriNetUnfolderBase]: 869/2651 cut-off events. [2025-03-17 19:39:19,990 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 19:39:19,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4383 conditions, 2651 events. 869/2651 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 21169 event pairs, 748 based on Foata normal form. 448/2787 useless extension candidates. Maximal degree in co-relation 2126. Up to 888 conditions per place. [2025-03-17 19:39:20,009 INFO L140 encePairwiseOnDemand]: 91/117 looper letters, 88 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-03-17 19:39:20,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 137 transitions, 473 flow [2025-03-17 19:39:20,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:39:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:39:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 310 transitions. [2025-03-17 19:39:20,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6623931623931624 [2025-03-17 19:39:20,024 INFO L175 Difference]: Start difference. First operand has 95 places, 115 transitions, 237 flow. Second operand 4 states and 310 transitions. [2025-03-17 19:39:20,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 137 transitions, 473 flow [2025-03-17 19:39:20,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 137 transitions, 473 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:39:20,033 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 214 flow [2025-03-17 19:39:20,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2025-03-17 19:39:20,038 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 3 predicate places. [2025-03-17 19:39:20,040 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 214 flow [2025-03-17 19:39:20,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:20,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:39:20,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:39:20,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:39:20,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-17 19:39:20,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:39:20,041 INFO L85 PathProgramCache]: Analyzing trace with hash 16855964, now seen corresponding path program 1 times [2025-03-17 19:39:20,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:39:20,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176879934] [2025-03-17 19:39:20,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:39:20,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:39:20,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:39:20,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:39:20,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:39:20,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:39:20,109 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-17 19:39:20,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:39:20,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176879934] [2025-03-17 19:39:20,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176879934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:39:20,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:39:20,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:39:20,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849031870] [2025-03-17 19:39:20,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:39:20,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:39:20,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:39:20,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:39:20,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:39:20,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 117 [2025-03-17 19:39:20,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:20,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:39:20,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 117 [2025-03-17 19:39:20,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:39:20,415 INFO L124 PetriNetUnfolderBase]: 869/2657 cut-off events. [2025-03-17 19:39:20,416 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-17 19:39:20,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4454 conditions, 2657 events. 869/2657 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 21226 event pairs, 765 based on Foata normal form. 1/2344 useless extension candidates. Maximal degree in co-relation 2225. Up to 1722 conditions per place. [2025-03-17 19:39:20,432 INFO L140 encePairwiseOnDemand]: 114/117 looper letters, 49 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2025-03-17 19:39:20,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 94 transitions, 314 flow [2025-03-17 19:39:20,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:39:20,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:39:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2025-03-17 19:39:20,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5213675213675214 [2025-03-17 19:39:20,436 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 214 flow. Second operand 3 states and 183 transitions. [2025-03-17 19:39:20,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 94 transitions, 314 flow [2025-03-17 19:39:20,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 309 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:39:20,438 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 211 flow [2025-03-17 19:39:20,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2025-03-17 19:39:20,438 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 2 predicate places. [2025-03-17 19:39:20,439 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 211 flow [2025-03-17 19:39:20,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:20,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:39:20,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 19:39:20,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 19:39:20,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-17 19:39:20,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:39:20,439 INFO L85 PathProgramCache]: Analyzing trace with hash 522535300, now seen corresponding path program 1 times [2025-03-17 19:39:20,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:39:20,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636917608] [2025-03-17 19:39:20,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:39:20,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:39:20,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:39:20,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:39:20,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:39:20,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:39:20,494 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-17 19:39:20,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:39:20,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636917608] [2025-03-17 19:39:20,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636917608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:39:20,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:39:20,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:39:20,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815752673] [2025-03-17 19:39:20,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:39:20,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:39:20,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:39:20,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:39:20,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:39:20,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 117 [2025-03-17 19:39:20,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 211 flow. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:20,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:39:20,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 117 [2025-03-17 19:39:20,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:39:20,774 INFO L124 PetriNetUnfolderBase]: 869/2656 cut-off events. [2025-03-17 19:39:20,774 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-17 19:39:20,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4433 conditions, 2656 events. 869/2656 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 21221 event pairs, 765 based on Foata normal form. 1/2343 useless extension candidates. Maximal degree in co-relation 2225. Up to 1722 conditions per place. [2025-03-17 19:39:20,786 INFO L140 encePairwiseOnDemand]: 114/117 looper letters, 48 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2025-03-17 19:39:20,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 93 transitions, 309 flow [2025-03-17 19:39:20,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:39:20,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:39:20,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2025-03-17 19:39:20,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-03-17 19:39:20,788 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 211 flow. Second operand 3 states and 182 transitions. [2025-03-17 19:39:20,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 93 transitions, 309 flow [2025-03-17 19:39:20,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 93 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:39:20,791 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 209 flow [2025-03-17 19:39:20,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2025-03-17 19:39:20,792 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 1 predicate places. [2025-03-17 19:39:20,792 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 209 flow [2025-03-17 19:39:20,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:20,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:39:20,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 19:39:20,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:39:20,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-17 19:39:20,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:39:20,794 INFO L85 PathProgramCache]: Analyzing trace with hash 522534506, now seen corresponding path program 1 times [2025-03-17 19:39:20,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:39:20,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672542930] [2025-03-17 19:39:20,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:39:20,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:39:20,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:39:20,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:39:20,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:39:20,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:39:20,852 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-17 19:39:20,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:39:20,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672542930] [2025-03-17 19:39:20,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672542930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:39:20,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:39:20,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:39:20,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663160993] [2025-03-17 19:39:20,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:39:20,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:39:20,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:39:20,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:39:20,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:39:20,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 117 [2025-03-17 19:39:20,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:20,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:39:20,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 117 [2025-03-17 19:39:20,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:39:21,191 INFO L124 PetriNetUnfolderBase]: 869/2648 cut-off events. [2025-03-17 19:39:21,191 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-17 19:39:21,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4425 conditions, 2648 events. 869/2648 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 21139 event pairs, 748 based on Foata normal form. 1/2336 useless extension candidates. Maximal degree in co-relation 2230. Up to 1663 conditions per place. [2025-03-17 19:39:21,200 INFO L140 encePairwiseOnDemand]: 110/117 looper letters, 52 selfloop transitions, 7 changer transitions 8/109 dead transitions. [2025-03-17 19:39:21,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 109 transitions, 375 flow [2025-03-17 19:39:21,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:39:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:39:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 287 transitions. [2025-03-17 19:39:21,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4905982905982906 [2025-03-17 19:39:21,202 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 209 flow. Second operand 5 states and 287 transitions. [2025-03-17 19:39:21,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 109 transitions, 375 flow [2025-03-17 19:39:21,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 109 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:39:21,204 INFO L231 Difference]: Finished difference. Result has 97 places, 92 transitions, 217 flow [2025-03-17 19:39:21,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=97, PETRI_TRANSITIONS=92} [2025-03-17 19:39:21,205 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 2 predicate places. [2025-03-17 19:39:21,205 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 92 transitions, 217 flow [2025-03-17 19:39:21,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:21,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:39:21,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:39:21,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:39:21,206 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-17 19:39:21,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:39:21,206 INFO L85 PathProgramCache]: Analyzing trace with hash 832115792, now seen corresponding path program 1 times [2025-03-17 19:39:21,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:39:21,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773460657] [2025-03-17 19:39:21,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:39:21,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:39:21,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:39:21,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:39:21,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:39:21,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:39:21,276 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-17 19:39:21,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:39:21,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773460657] [2025-03-17 19:39:21,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773460657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:39:21,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:39:21,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:39:21,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167545442] [2025-03-17 19:39:21,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:39:21,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:39:21,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:39:21,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:39:21,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:39:21,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 117 [2025-03-17 19:39:21,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 92 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:21,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:39:21,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 117 [2025-03-17 19:39:21,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:39:21,540 INFO L124 PetriNetUnfolderBase]: 855/2365 cut-off events. [2025-03-17 19:39:21,540 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-17 19:39:21,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4168 conditions, 2365 events. 855/2365 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 18470 event pairs, 0 based on Foata normal form. 36/2166 useless extension candidates. Maximal degree in co-relation 2054. Up to 1602 conditions per place. [2025-03-17 19:39:21,549 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 83 selfloop transitions, 3 changer transitions 0/125 dead transitions. [2025-03-17 19:39:21,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 125 transitions, 455 flow [2025-03-17 19:39:21,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:39:21,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:39:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2025-03-17 19:39:21,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-17 19:39:21,554 INFO L175 Difference]: Start difference. First operand has 97 places, 92 transitions, 217 flow. Second operand 4 states and 260 transitions. [2025-03-17 19:39:21,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 125 transitions, 455 flow [2025-03-17 19:39:21,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 125 transitions, 441 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 19:39:21,562 INFO L231 Difference]: Finished difference. Result has 95 places, 90 transitions, 209 flow [2025-03-17 19:39:21,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=95, PETRI_TRANSITIONS=90} [2025-03-17 19:39:21,565 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 0 predicate places. [2025-03-17 19:39:21,565 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 209 flow [2025-03-17 19:39:21,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:21,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:39:21,566 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:39:21,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:39:21,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-17 19:39:21,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:39:21,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1589012854, now seen corresponding path program 1 times [2025-03-17 19:39:21,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:39:21,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175187459] [2025-03-17 19:39:21,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:39:21,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:39:21,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:39:21,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:39:21,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:39:21,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:39:21,591 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:39:21,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:39:21,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:39:21,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:39:21,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:39:21,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:39:21,627 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 19:39:21,628 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2025-03-17 19:39:21,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2025-03-17 19:39:21,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2025-03-17 19:39:21,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2025-03-17 19:39:21,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2025-03-17 19:39:21,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2025-03-17 19:39:21,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2025-03-17 19:39:21,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2025-03-17 19:39:21,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2025-03-17 19:39:21,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2025-03-17 19:39:21,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2025-03-17 19:39:21,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2025-03-17 19:39:21,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2025-03-17 19:39:21,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2025-03-17 19:39:21,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2025-03-17 19:39:21,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2025-03-17 19:39:21,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2025-03-17 19:39:21,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2025-03-17 19:39:21,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2025-03-17 19:39:21,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2025-03-17 19:39:21,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2025-03-17 19:39:21,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:39:21,631 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 19:39:21,633 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 19:39:21,633 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 19:39:21,662 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 19:39:21,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 162 transitions, 340 flow [2025-03-17 19:39:21,679 INFO L124 PetriNetUnfolderBase]: 60/276 cut-off events. [2025-03-17 19:39:21,679 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 19:39:21,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 276 events. 60/276 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1228 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 166. Up to 12 conditions per place. [2025-03-17 19:39:21,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 162 transitions, 340 flow [2025-03-17 19:39:21,683 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 161 transitions, 338 flow [2025-03-17 19:39:21,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:39:21,685 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;@3685b984, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:39:21,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-17 19:39:21,686 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:39:21,686 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-17 19:39:21,686 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:39:21,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:39:21,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:39:21,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-17 19:39:21,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:39:21,686 INFO L85 PathProgramCache]: Analyzing trace with hash 21842945, now seen corresponding path program 1 times [2025-03-17 19:39:21,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:39:21,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251831557] [2025-03-17 19:39:21,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:39:21,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:39:21,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:39:21,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:39:21,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:39:21,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:39:21,720 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-17 19:39:21,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:39:21,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251831557] [2025-03-17 19:39:21,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251831557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:39:21,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:39:21,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:39:21,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124790130] [2025-03-17 19:39:21,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:39:21,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:39:21,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:39:21,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:39:21,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:39:21,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 162 [2025-03-17 19:39:21,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 161 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:21,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:39:21,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 162 [2025-03-17 19:39:21,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:39:25,507 INFO L124 PetriNetUnfolderBase]: 31927/66877 cut-off events. [2025-03-17 19:39:25,507 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-03-17 19:39:25,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114556 conditions, 66877 events. 31927/66877 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 2004. Compared 737644 event pairs, 28458 based on Foata normal form. 13069/72579 useless extension candidates. Maximal degree in co-relation 49513. Up to 24438 conditions per place. [2025-03-17 19:39:25,836 INFO L140 encePairwiseOnDemand]: 126/162 looper letters, 128 selfloop transitions, 5 changer transitions 0/193 dead transitions. [2025-03-17 19:39:25,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 193 transitions, 682 flow [2025-03-17 19:39:25,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:39:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:39:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2025-03-17 19:39:25,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6697530864197531 [2025-03-17 19:39:25,838 INFO L175 Difference]: Start difference. First operand has 130 places, 161 transitions, 338 flow. Second operand 4 states and 434 transitions. [2025-03-17 19:39:25,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 193 transitions, 682 flow [2025-03-17 19:39:25,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 193 transitions, 682 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:39:25,843 INFO L231 Difference]: Finished difference. Result has 133 places, 131 transitions, 295 flow [2025-03-17 19:39:25,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=133, PETRI_TRANSITIONS=131} [2025-03-17 19:39:25,845 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-03-17 19:39:25,845 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 131 transitions, 295 flow [2025-03-17 19:39:25,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:25,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:39:25,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:39:25,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 19:39:25,847 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-17 19:39:25,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:39:25,848 INFO L85 PathProgramCache]: Analyzing trace with hash 21842972, now seen corresponding path program 1 times [2025-03-17 19:39:25,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:39:25,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829956179] [2025-03-17 19:39:25,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:39:25,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:39:25,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:39:25,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:39:25,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:39:25,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:39:25,880 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-17 19:39:25,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:39:25,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829956179] [2025-03-17 19:39:25,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829956179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:39:25,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:39:25,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:39:25,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750664548] [2025-03-17 19:39:25,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:39:25,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:39:25,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:39:25,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:39:25,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:39:25,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 162 [2025-03-17 19:39:25,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 131 transitions, 295 flow. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:25,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:39:25,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 162 [2025-03-17 19:39:25,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:39:29,238 INFO L124 PetriNetUnfolderBase]: 31941/67149 cut-off events. [2025-03-17 19:39:29,239 INFO L125 PetriNetUnfolderBase]: For 590/590 co-relation queries the response was YES. [2025-03-17 19:39:29,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115933 conditions, 67149 events. 31941/67149 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 2006. Compared 742364 event pairs, 29104 based on Foata normal form. 1/59648 useless extension candidates. Maximal degree in co-relation 58585. Up to 47500 conditions per place. [2025-03-17 19:39:29,557 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 69 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2025-03-17 19:39:29,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 130 transitions, 435 flow [2025-03-17 19:39:29,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:39:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:39:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-03-17 19:39:29,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5164609053497943 [2025-03-17 19:39:29,559 INFO L175 Difference]: Start difference. First operand has 133 places, 131 transitions, 295 flow. Second operand 3 states and 251 transitions. [2025-03-17 19:39:29,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 130 transitions, 435 flow [2025-03-17 19:39:29,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 130 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:39:29,563 INFO L231 Difference]: Finished difference. Result has 132 places, 130 transitions, 292 flow [2025-03-17 19:39:29,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=132, PETRI_TRANSITIONS=130} [2025-03-17 19:39:29,564 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-03-17 19:39:29,564 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 130 transitions, 292 flow [2025-03-17 19:39:29,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:29,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:39:29,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 19:39:29,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:39:29,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-17 19:39:29,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:39:29,565 INFO L85 PathProgramCache]: Analyzing trace with hash 677132710, now seen corresponding path program 1 times [2025-03-17 19:39:29,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:39:29,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270353241] [2025-03-17 19:39:29,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:39:29,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:39:29,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:39:29,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:39:29,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:39:29,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:39:29,591 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-17 19:39:29,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:39:29,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270353241] [2025-03-17 19:39:29,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270353241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:39:29,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:39:29,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:39:29,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571423806] [2025-03-17 19:39:29,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:39:29,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:39:29,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:39:29,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:39:29,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:39:29,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 162 [2025-03-17 19:39:29,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 130 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:29,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:39:29,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 162 [2025-03-17 19:39:29,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:39:33,021 INFO L124 PetriNetUnfolderBase]: 31941/67148 cut-off events. [2025-03-17 19:39:33,021 INFO L125 PetriNetUnfolderBase]: For 590/590 co-relation queries the response was YES. [2025-03-17 19:39:33,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115570 conditions, 67148 events. 31941/67148 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 2006. Compared 742380 event pairs, 29104 based on Foata normal form. 1/59647 useless extension candidates. Maximal degree in co-relation 58585. Up to 47500 conditions per place. [2025-03-17 19:39:33,299 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 68 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2025-03-17 19:39:33,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 129 transitions, 430 flow [2025-03-17 19:39:33,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:39:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:39:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2025-03-17 19:39:33,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51440329218107 [2025-03-17 19:39:33,301 INFO L175 Difference]: Start difference. First operand has 132 places, 130 transitions, 292 flow. Second operand 3 states and 250 transitions. [2025-03-17 19:39:33,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 129 transitions, 430 flow [2025-03-17 19:39:33,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 129 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:39:33,303 INFO L231 Difference]: Finished difference. Result has 131 places, 129 transitions, 290 flow [2025-03-17 19:39:33,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=131, PETRI_TRANSITIONS=129} [2025-03-17 19:39:33,303 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 1 predicate places. [2025-03-17 19:39:33,304 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 290 flow [2025-03-17 19:39:33,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:33,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:39:33,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 19:39:33,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 19:39:33,304 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-17 19:39:33,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:39:33,304 INFO L85 PathProgramCache]: Analyzing trace with hash 677131916, now seen corresponding path program 1 times [2025-03-17 19:39:33,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:39:33,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892049937] [2025-03-17 19:39:33,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:39:33,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:39:33,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:39:33,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:39:33,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:39:33,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:39:33,345 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-17 19:39:33,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:39:33,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892049937] [2025-03-17 19:39:33,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892049937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:39:33,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:39:33,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:39:33,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057170555] [2025-03-17 19:39:33,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:39:33,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:39:33,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:39:33,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:39:33,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:39:33,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 162 [2025-03-17 19:39:33,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 129 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:33,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:39:33,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 162 [2025-03-17 19:39:33,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:39:36,958 INFO L124 PetriNetUnfolderBase]: 31927/66874 cut-off events. [2025-03-17 19:39:36,959 INFO L125 PetriNetUnfolderBase]: For 590/590 co-relation queries the response was YES. [2025-03-17 19:39:37,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115282 conditions, 66874 events. 31927/66874 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 2004. Compared 737461 event pairs, 28458 based on Foata normal form. 1/59420 useless extension candidates. Maximal degree in co-relation 58310. Up to 46091 conditions per place. [2025-03-17 19:39:37,240 INFO L140 encePairwiseOnDemand]: 155/162 looper letters, 97 selfloop transitions, 7 changer transitions 0/162 dead transitions. [2025-03-17 19:39:37,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 162 transitions, 564 flow [2025-03-17 19:39:37,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:39:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:39:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 404 transitions. [2025-03-17 19:39:37,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49876543209876545 [2025-03-17 19:39:37,242 INFO L175 Difference]: Start difference. First operand has 131 places, 129 transitions, 290 flow. Second operand 5 states and 404 transitions. [2025-03-17 19:39:37,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 162 transitions, 564 flow [2025-03-17 19:39:37,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 162 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:39:37,246 INFO L231 Difference]: Finished difference. Result has 132 places, 128 transitions, 298 flow [2025-03-17 19:39:37,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=298, PETRI_PLACES=132, PETRI_TRANSITIONS=128} [2025-03-17 19:39:37,247 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-03-17 19:39:37,247 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 128 transitions, 298 flow [2025-03-17 19:39:37,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:37,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:39:37,247 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:39:37,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 19:39:37,247 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-17 19:39:37,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:39:37,248 INFO L85 PathProgramCache]: Analyzing trace with hash -281445637, now seen corresponding path program 1 times [2025-03-17 19:39:37,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:39:37,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258621273] [2025-03-17 19:39:37,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:39:37,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:39:37,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:39:37,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:39:37,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:39:37,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:39:37,309 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-17 19:39:37,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:39:37,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258621273] [2025-03-17 19:39:37,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258621273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:39:37,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:39:37,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:39:37,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106264761] [2025-03-17 19:39:37,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:39:37,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:39:37,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:39:37,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:39:37,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:39:37,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-17 19:39:37,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 128 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:37,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:39:37,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-17 19:39:37,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:39:40,790 INFO L124 PetriNetUnfolderBase]: 34858/70183 cut-off events. [2025-03-17 19:39:40,790 INFO L125 PetriNetUnfolderBase]: For 1248/1248 co-relation queries the response was YES. [2025-03-17 19:39:40,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124089 conditions, 70183 events. 34858/70183 cut-off events. For 1248/1248 co-relation queries the response was YES. Maximal size of possible extension queue 1993. Compared 753679 event pairs, 17757 based on Foata normal form. 36/62493 useless extension candidates. Maximal degree in co-relation 59858. Up to 52150 conditions per place. [2025-03-17 19:39:41,324 INFO L140 encePairwiseOnDemand]: 156/162 looper letters, 107 selfloop transitions, 3 changer transitions 0/165 dead transitions. [2025-03-17 19:39:41,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 165 transitions, 592 flow [2025-03-17 19:39:41,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:39:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:39:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2025-03-17 19:39:41,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-03-17 19:39:41,326 INFO L175 Difference]: Start difference. First operand has 132 places, 128 transitions, 298 flow. Second operand 4 states and 348 transitions. [2025-03-17 19:39:41,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 165 transitions, 592 flow [2025-03-17 19:39:41,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 165 transitions, 578 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 19:39:41,365 INFO L231 Difference]: Finished difference. Result has 133 places, 130 transitions, 308 flow [2025-03-17 19:39:41,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=133, PETRI_TRANSITIONS=130} [2025-03-17 19:39:41,365 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-03-17 19:39:41,366 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 130 transitions, 308 flow [2025-03-17 19:39:41,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:41,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:39:41,366 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:39:41,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 19:39:41,366 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-17 19:39:41,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:39:41,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1995573433, now seen corresponding path program 1 times [2025-03-17 19:39:41,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:39:41,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024745622] [2025-03-17 19:39:41,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:39:41,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:39:41,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 19:39:41,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:39:41,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:39:41,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:39:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:39:41,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:39:41,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024745622] [2025-03-17 19:39:41,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024745622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:39:41,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:39:41,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:39:41,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285530557] [2025-03-17 19:39:41,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:39:41,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:39:41,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:39:41,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:39:41,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:39:41,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-17 19:39:41,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 130 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:41,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:39:41,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-17 19:39:41,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:39:45,188 INFO L124 PetriNetUnfolderBase]: 33941/66342 cut-off events. [2025-03-17 19:39:45,188 INFO L125 PetriNetUnfolderBase]: For 2896/2896 co-relation queries the response was YES. [2025-03-17 19:39:45,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120908 conditions, 66342 events. 33941/66342 cut-off events. For 2896/2896 co-relation queries the response was YES. Maximal size of possible extension queue 1960. Compared 698590 event pairs, 4820 based on Foata normal form. 648/61170 useless extension candidates. Maximal degree in co-relation 58652. Up to 41665 conditions per place. [2025-03-17 19:39:45,492 INFO L140 encePairwiseOnDemand]: 157/162 looper letters, 171 selfloop transitions, 6 changer transitions 0/232 dead transitions. [2025-03-17 19:39:45,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 232 transitions, 864 flow [2025-03-17 19:39:45,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:39:45,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:39:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2025-03-17 19:39:45,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2025-03-17 19:39:45,494 INFO L175 Difference]: Start difference. First operand has 133 places, 130 transitions, 308 flow. Second operand 6 states and 531 transitions. [2025-03-17 19:39:45,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 232 transitions, 864 flow [2025-03-17 19:39:45,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 232 transitions, 862 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:39:45,499 INFO L231 Difference]: Finished difference. Result has 136 places, 129 transitions, 314 flow [2025-03-17 19:39:45,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=136, PETRI_TRANSITIONS=129} [2025-03-17 19:39:45,500 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 6 predicate places. [2025-03-17 19:39:45,500 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 129 transitions, 314 flow [2025-03-17 19:39:45,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:45,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:39:45,500 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:39:45,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 19:39:45,501 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-17 19:39:45,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:39:45,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2002971716, now seen corresponding path program 1 times [2025-03-17 19:39:45,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:39:45,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189268866] [2025-03-17 19:39:45,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:39:45,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:39:45,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:39:45,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:39:45,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:39:45,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:39:45,569 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-17 19:39:45,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:39:45,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189268866] [2025-03-17 19:39:45,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189268866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:39:45,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:39:45,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:39:45,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354253770] [2025-03-17 19:39:45,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:39:45,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:39:45,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:39:45,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:39:45,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:39:45,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 162 [2025-03-17 19:39:45,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 129 transitions, 314 flow. Second operand has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:45,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:39:45,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 162 [2025-03-17 19:39:45,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:39:50,971 INFO L124 PetriNetUnfolderBase]: 46385/94447 cut-off events. [2025-03-17 19:39:50,971 INFO L125 PetriNetUnfolderBase]: For 6340/7200 co-relation queries the response was YES. [2025-03-17 19:39:51,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170674 conditions, 94447 events. 46385/94447 cut-off events. For 6340/7200 co-relation queries the response was YES. Maximal size of possible extension queue 3002. Compared 1072444 event pairs, 16289 based on Foata normal form. 1114/86800 useless extension candidates. Maximal degree in co-relation 81952. Up to 44124 conditions per place. [2025-03-17 19:39:51,375 INFO L140 encePairwiseOnDemand]: 150/162 looper letters, 207 selfloop transitions, 16 changer transitions 0/279 dead transitions. [2025-03-17 19:39:51,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 279 transitions, 1126 flow [2025-03-17 19:39:51,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:39:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:39:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 520 transitions. [2025-03-17 19:39:51,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6419753086419753 [2025-03-17 19:39:51,377 INFO L175 Difference]: Start difference. First operand has 136 places, 129 transitions, 314 flow. Second operand 5 states and 520 transitions. [2025-03-17 19:39:51,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 279 transitions, 1126 flow [2025-03-17 19:39:51,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 279 transitions, 1103 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-17 19:39:51,383 INFO L231 Difference]: Finished difference. Result has 140 places, 144 transitions, 430 flow [2025-03-17 19:39:51,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=430, PETRI_PLACES=140, PETRI_TRANSITIONS=144} [2025-03-17 19:39:51,384 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 10 predicate places. [2025-03-17 19:39:51,384 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 144 transitions, 430 flow [2025-03-17 19:39:51,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:51,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:39:51,384 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:39:51,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 19:39:51,384 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-17 19:39:51,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:39:51,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1733234866, now seen corresponding path program 1 times [2025-03-17 19:39:51,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:39:51,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350605797] [2025-03-17 19:39:51,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:39:51,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:39:51,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:39:51,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:39:51,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:39:51,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:39:51,419 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-17 19:39:51,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:39:51,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350605797] [2025-03-17 19:39:51,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350605797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:39:51,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:39:51,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:39:51,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971423328] [2025-03-17 19:39:51,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:39:51,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:39:51,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:39:51,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:39:51,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:39:51,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-17 19:39:51,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 144 transitions, 430 flow. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:39:51,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:39:51,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-17 19:39:51,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand