./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c0354ee6107efc04d15102ecf9eef73430e38e14b70f16419cd07cd733fd0df --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:36:12,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:36:12,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:36:12,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:36:12,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:36:12,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:36:12,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:36:12,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:36:12,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:36:12,556 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:36:12,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:36:12,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:36:12,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:36:12,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:36:12,556 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:36:12,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:36:12,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:36:12,557 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:36:12,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:36:12,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:36:12,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:36:12,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:36:12,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:36:12,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:36:12,557 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:36:12,557 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:36:12,557 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:36:12,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:36:12,558 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:36:12,558 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:36:12,558 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:36:12,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:36:12,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:36:12,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:36:12,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:36:12,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:36:12,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:36:12,559 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:36:12,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:36:12,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:36:12,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:36:12,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:36:12,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:36:12,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:36:12,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:36:12,559 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 -> 3c0354ee6107efc04d15102ecf9eef73430e38e14b70f16419cd07cd733fd0df [2025-03-09 06:36:12,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:36:12,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:36:12,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:36:12,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:36:12,780 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:36:12,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2025-03-09 06:36:13,918 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c3d3c76/e5fa94d686f8433cad20bfa66ceb386c/FLAG21f06d4d9 [2025-03-09 06:36:14,241 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:36:14,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2025-03-09 06:36:14,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c3d3c76/e5fa94d686f8433cad20bfa66ceb386c/FLAG21f06d4d9 [2025-03-09 06:36:14,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c3d3c76/e5fa94d686f8433cad20bfa66ceb386c [2025-03-09 06:36:14,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:36:14,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:36:14,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:36:14,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:36:14,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:36:14,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:36:14" (1/1) ... [2025-03-09 06:36:14,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f06443e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:14, skipping insertion in model container [2025-03-09 06:36:14,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:36:14" (1/1) ... [2025-03-09 06:36:14,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:36:14,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:36:14,808 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:36:14,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:36:14,895 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:36:14,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:14 WrapperNode [2025-03-09 06:36:14,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:36:14,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:36:14,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:36:14,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:36:14,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:14" (1/1) ... [2025-03-09 06:36:14,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:14" (1/1) ... [2025-03-09 06:36:14,929 INFO L138 Inliner]: procedures = 271, calls = 110, calls flagged for inlining = 7, calls inlined = 8, statements flattened = 271 [2025-03-09 06:36:14,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:36:14,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:36:14,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:36:14,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:36:14,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:14" (1/1) ... [2025-03-09 06:36:14,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:14" (1/1) ... [2025-03-09 06:36:14,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:14" (1/1) ... [2025-03-09 06:36:14,955 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 5, 2, 70]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 0, 60]. The 5 writes are split as follows [0, 0, 1, 4]. [2025-03-09 06:36:14,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:14" (1/1) ... [2025-03-09 06:36:14,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:14" (1/1) ... [2025-03-09 06:36:14,961 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:14" (1/1) ... [2025-03-09 06:36:14,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:14" (1/1) ... [2025-03-09 06:36:14,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:14" (1/1) ... [2025-03-09 06:36:14,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:14" (1/1) ... [2025-03-09 06:36:14,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:36:14,969 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:36:14,969 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:36:14,969 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:36:14,970 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:14" (1/1) ... [2025-03-09 06:36:14,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:36:14,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:36:14,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 06:36:14,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 06:36:15,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:36:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:36:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 06:36:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:36:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:36:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:36:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 06:36:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:36:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:36:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:36:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 06:36:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 06:36:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:36:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 06:36:15,012 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 06:36:15,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:36:15,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:36:15,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:36:15,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 06:36:15,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:36:15,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:36:15,013 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:36:15,120 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:36:15,121 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:36:15,350 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L953: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-09 06:36:15,350 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-09 06:36:15,418 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:36:15,418 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:36:15,693 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:36:15,694 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:36:15,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:36:15 BoogieIcfgContainer [2025-03-09 06:36:15,694 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:36:15,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:36:15,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:36:15,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:36:15,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:36:14" (1/3) ... [2025-03-09 06:36:15,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137c7ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:36:15, skipping insertion in model container [2025-03-09 06:36:15,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:14" (2/3) ... [2025-03-09 06:36:15,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137c7ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:36:15, skipping insertion in model container [2025-03-09 06:36:15,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:36:15" (3/3) ... [2025-03-09 06:36:15,702 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_75-tricky_address2_racefree.i [2025-03-09 06:36:15,715 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:36:15,717 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_75-tricky_address2_racefree.i that has 2 procedures, 85 locations, 1 initial locations, 11 loop locations, and 14 error locations. [2025-03-09 06:36:15,717 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:36:15,761 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-09 06:36:15,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 109 transitions, 225 flow [2025-03-09 06:36:15,857 INFO L124 PetriNetUnfolderBase]: 35/155 cut-off events. [2025-03-09 06:36:15,860 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:36:15,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 155 events. 35/155 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 611 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 94. Up to 8 conditions per place. [2025-03-09 06:36:15,864 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 109 transitions, 225 flow [2025-03-09 06:36:15,867 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 108 transitions, 223 flow [2025-03-09 06:36:15,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:36:15,887 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;@2d05a5cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:36:15,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-09 06:36:15,894 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:36:15,894 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-09 06:36:15,894 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:36:15,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:15,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 06:36:15,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:36:15,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:15,900 INFO L85 PathProgramCache]: Analyzing trace with hash 645923, now seen corresponding path program 1 times [2025-03-09 06:36:15,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:15,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959757282] [2025-03-09 06:36:15,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:15,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:15,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:36:16,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:36:16,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:16,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:16,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:16,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959757282] [2025-03-09 06:36:16,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959757282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:16,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:16,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:36:16,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194276827] [2025-03-09 06:36:16,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:16,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:36:16,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:16,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:36:16,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:36:16,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 109 [2025-03-09 06:36:16,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 108 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:16,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:16,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 109 [2025-03-09 06:36:16,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:16,534 INFO L124 PetriNetUnfolderBase]: 440/1359 cut-off events. [2025-03-09 06:36:16,536 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:36:16,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2247 conditions, 1359 events. 440/1359 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9055 event pairs, 396 based on Foata normal form. 225/1419 useless extension candidates. Maximal degree in co-relation 2157. Up to 881 conditions per place. [2025-03-09 06:36:16,547 INFO L140 encePairwiseOnDemand]: 83/109 looper letters, 47 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2025-03-09 06:36:16,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 287 flow [2025-03-09 06:36:16,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:36:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:36:16,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2025-03-09 06:36:16,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344036697247706 [2025-03-09 06:36:16,560 INFO L175 Difference]: Start difference. First operand has 88 places, 108 transitions, 223 flow. Second operand 4 states and 233 transitions. [2025-03-09 06:36:16,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 287 flow [2025-03-09 06:36:16,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 287 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:36:16,569 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 207 flow [2025-03-09 06:36:16,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2025-03-09 06:36:16,574 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2025-03-09 06:36:16,575 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 207 flow [2025-03-09 06:36:16,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:16,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:16,575 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 06:36:16,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:36:16,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:36:16,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:16,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2063364083, now seen corresponding path program 1 times [2025-03-09 06:36:16,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:16,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469200139] [2025-03-09 06:36:16,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:16,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:16,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:36:16,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:36:16,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:16,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:16,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:16,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469200139] [2025-03-09 06:36:16,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469200139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:36:16,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810851862] [2025-03-09 06:36:16,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:16,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:36:16,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:36:16,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:36:16,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:36:16,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:36:16,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:36:16,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:16,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:16,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:36:16,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:36:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:16,844 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:36:16,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810851862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:16,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:36:16,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 06:36:16,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223647111] [2025-03-09 06:36:16,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:16,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:36:16,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:16,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:36:16,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:36:16,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 109 [2025-03-09 06:36:16,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 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-09 06:36:16,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:16,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 109 [2025-03-09 06:36:16,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:17,064 INFO L124 PetriNetUnfolderBase]: 440/1358 cut-off events. [2025-03-09 06:36:17,064 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 06:36:17,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2257 conditions, 1358 events. 440/1358 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9047 event pairs, 396 based on Foata normal form. 1/1194 useless extension candidates. Maximal degree in co-relation 2239. Up to 876 conditions per place. [2025-03-09 06:36:17,071 INFO L140 encePairwiseOnDemand]: 104/109 looper letters, 43 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2025-03-09 06:36:17,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 89 transitions, 301 flow [2025-03-09 06:36:17,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:36:17,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:36:17,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 290 transitions. [2025-03-09 06:36:17,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4434250764525994 [2025-03-09 06:36:17,074 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 207 flow. Second operand 6 states and 290 transitions. [2025-03-09 06:36:17,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 89 transitions, 301 flow [2025-03-09 06:36:17,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 89 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:36:17,077 INFO L231 Difference]: Finished difference. Result has 96 places, 89 transitions, 213 flow [2025-03-09 06:36:17,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=96, PETRI_TRANSITIONS=89} [2025-03-09 06:36:17,078 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 8 predicate places. [2025-03-09 06:36:17,078 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 213 flow [2025-03-09 06:36:17,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 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-09 06:36:17,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:17,078 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-09 06:36:17,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:36:17,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:36:17,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:36:17,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:17,282 INFO L85 PathProgramCache]: Analyzing trace with hash -460222325, now seen corresponding path program 1 times [2025-03-09 06:36:17,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:17,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410014047] [2025-03-09 06:36:17,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:17,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:17,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:36:17,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:36:17,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:17,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:36:17,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:17,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410014047] [2025-03-09 06:36:17,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410014047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:17,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:17,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:36:17,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447556244] [2025-03-09 06:36:17,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:17,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:36:17,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:17,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:36:17,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:36:17,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 109 [2025-03-09 06:36:17,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:17,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:17,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 109 [2025-03-09 06:36:17,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:17,547 INFO L124 PetriNetUnfolderBase]: 440/1357 cut-off events. [2025-03-09 06:36:17,548 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-09 06:36:17,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2259 conditions, 1357 events. 440/1357 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9058 event pairs, 396 based on Foata normal form. 1/1194 useless extension candidates. Maximal degree in co-relation 2235. Up to 879 conditions per place. [2025-03-09 06:36:17,556 INFO L140 encePairwiseOnDemand]: 106/109 looper letters, 44 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2025-03-09 06:36:17,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 88 transitions, 305 flow [2025-03-09 06:36:17,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:36:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:36:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2025-03-09 06:36:17,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5107033639143731 [2025-03-09 06:36:17,558 INFO L175 Difference]: Start difference. First operand has 96 places, 89 transitions, 213 flow. Second operand 3 states and 167 transitions. [2025-03-09 06:36:17,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 88 transitions, 305 flow [2025-03-09 06:36:17,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 88 transitions, 283 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-09 06:36:17,563 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 195 flow [2025-03-09 06:36:17,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2025-03-09 06:36:17,564 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 3 predicate places. [2025-03-09 06:36:17,564 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 195 flow [2025-03-09 06:36:17,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:17,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:17,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:17,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:36:17,564 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:36:17,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:17,565 INFO L85 PathProgramCache]: Analyzing trace with hash 109245424, now seen corresponding path program 1 times [2025-03-09 06:36:17,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:17,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741570158] [2025-03-09 06:36:17,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:17,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:17,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:36:17,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:36:17,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:17,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:17,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:17,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:17,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741570158] [2025-03-09 06:36:17,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741570158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:36:17,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386269437] [2025-03-09 06:36:17,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:17,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:36:17,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:36:17,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:36:17,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:36:17,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:36:17,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:36:17,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:17,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:17,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:36:17,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:36:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:17,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:36:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:17,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386269437] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:36:17,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:36:17,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 06:36:17,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597992877] [2025-03-09 06:36:17,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:36:17,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:36:17,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:17,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:36:17,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:36:17,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 109 [2025-03-09 06:36:17,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 195 flow. Second operand has 10 states, 10 states have (on average 41.3) internal successors, (413), 10 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:17,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:17,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 109 [2025-03-09 06:36:17,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:18,086 INFO L124 PetriNetUnfolderBase]: 440/1361 cut-off events. [2025-03-09 06:36:18,087 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-09 06:36:18,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2262 conditions, 1361 events. 440/1361 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9030 event pairs, 396 based on Foata normal form. 2/1200 useless extension candidates. Maximal degree in co-relation 2228. Up to 877 conditions per place. [2025-03-09 06:36:18,094 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 44 selfloop transitions, 7 changer transitions 0/91 dead transitions. [2025-03-09 06:36:18,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 91 transitions, 312 flow [2025-03-09 06:36:18,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:36:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:36:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 333 transitions. [2025-03-09 06:36:18,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.436435124508519 [2025-03-09 06:36:18,098 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 195 flow. Second operand 7 states and 333 transitions. [2025-03-09 06:36:18,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 91 transitions, 312 flow [2025-03-09 06:36:18,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 91 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:36:18,101 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 221 flow [2025-03-09 06:36:18,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=97, PETRI_TRANSITIONS=91} [2025-03-09 06:36:18,103 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 9 predicate places. [2025-03-09 06:36:18,103 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 221 flow [2025-03-09 06:36:18,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 41.3) internal successors, (413), 10 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:18,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:18,104 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:18,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:36:18,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 06:36:18,305 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:36:18,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:18,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1079606800, now seen corresponding path program 2 times [2025-03-09 06:36:18,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:18,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810509996] [2025-03-09 06:36:18,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:36:18,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:18,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-09 06:36:18,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-09 06:36:18,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:36:18,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 06:36:18,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:18,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810509996] [2025-03-09 06:36:18,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810509996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:18,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:18,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:36:18,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164974058] [2025-03-09 06:36:18,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:18,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:36:18,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:18,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:36:18,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:36:18,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 109 [2025-03-09 06:36:18,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 91 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:18,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:18,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 109 [2025-03-09 06:36:18,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:18,581 INFO L124 PetriNetUnfolderBase]: 435/1226 cut-off events. [2025-03-09 06:36:18,581 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 06:36:18,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2132 conditions, 1226 events. 435/1226 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 8033 event pairs, 0 based on Foata normal form. 19/1123 useless extension candidates. Maximal degree in co-relation 2093. Up to 824 conditions per place. [2025-03-09 06:36:18,588 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 86 selfloop transitions, 3 changer transitions 0/126 dead transitions. [2025-03-09 06:36:18,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 126 transitions, 469 flow [2025-03-09 06:36:18,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:36:18,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:36:18,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2025-03-09 06:36:18,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5573394495412844 [2025-03-09 06:36:18,590 INFO L175 Difference]: Start difference. First operand has 97 places, 91 transitions, 221 flow. Second operand 4 states and 243 transitions. [2025-03-09 06:36:18,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 126 transitions, 469 flow [2025-03-09 06:36:18,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 126 transitions, 465 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:36:18,595 INFO L231 Difference]: Finished difference. Result has 97 places, 89 transitions, 223 flow [2025-03-09 06:36:18,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=97, PETRI_TRANSITIONS=89} [2025-03-09 06:36:18,596 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 9 predicate places. [2025-03-09 06:36:18,596 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 89 transitions, 223 flow [2025-03-09 06:36:18,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:18,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:18,597 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:18,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:36:18,597 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:36:18,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:18,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1850505953, now seen corresponding path program 1 times [2025-03-09 06:36:18,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:18,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287828193] [2025-03-09 06:36:18,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:18,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:18,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:36:18,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:36:18,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:18,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:18,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:18,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287828193] [2025-03-09 06:36:18,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287828193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:36:18,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120988152] [2025-03-09 06:36:18,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:18,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:36:18,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:36:18,734 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:36:18,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:36:18,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:36:18,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:36:18,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:18,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:18,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:36:18,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:36:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:18,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:36:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:18,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120988152] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:36:18,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:36:18,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-09 06:36:18,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782771344] [2025-03-09 06:36:18,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:36:18,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 06:36:18,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:18,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 06:36:18,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-09 06:36:18,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 109 [2025-03-09 06:36:18,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 89 transitions, 223 flow. Second operand has 18 states, 18 states have (on average 41.22222222222222) internal successors, (742), 18 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:18,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:18,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 109 [2025-03-09 06:36:18,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:19,208 INFO L124 PetriNetUnfolderBase]: 439/1320 cut-off events. [2025-03-09 06:36:19,209 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-09 06:36:19,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2273 conditions, 1320 events. 439/1320 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8566 event pairs, 396 based on Foata normal form. 4/1189 useless extension candidates. Maximal degree in co-relation 2198. Up to 857 conditions per place. [2025-03-09 06:36:19,215 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 44 selfloop transitions, 15 changer transitions 0/97 dead transitions. [2025-03-09 06:36:19,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 97 transitions, 389 flow [2025-03-09 06:36:19,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 06:36:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 06:36:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 663 transitions. [2025-03-09 06:36:19,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4055045871559633 [2025-03-09 06:36:19,217 INFO L175 Difference]: Start difference. First operand has 97 places, 89 transitions, 223 flow. Second operand 15 states and 663 transitions. [2025-03-09 06:36:19,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 97 transitions, 389 flow [2025-03-09 06:36:19,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 97 transitions, 383 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:36:19,221 INFO L231 Difference]: Finished difference. Result has 112 places, 97 transitions, 314 flow [2025-03-09 06:36:19,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=314, PETRI_PLACES=112, PETRI_TRANSITIONS=97} [2025-03-09 06:36:19,222 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 24 predicate places. [2025-03-09 06:36:19,222 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 97 transitions, 314 flow [2025-03-09 06:36:19,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 41.22222222222222) internal successors, (742), 18 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:19,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:19,222 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:19,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 06:36:19,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:36:19,423 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:36:19,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:19,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1841403617, now seen corresponding path program 2 times [2025-03-09 06:36:19,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:19,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584456546] [2025-03-09 06:36:19,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:36:19,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:19,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 06:36:19,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:36:19,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:36:19,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:19,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:19,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584456546] [2025-03-09 06:36:19,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584456546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:36:19,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618492951] [2025-03-09 06:36:19,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:36:19,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:36:19,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:36:19,686 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:36:19,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 06:36:19,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 06:36:19,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:36:19,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:36:19,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:19,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:36:19,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:36:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:19,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:36:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:19,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618492951] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:36:19,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:36:19,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-03-09 06:36:19,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594716104] [2025-03-09 06:36:19,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:36:19,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 06:36:19,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:19,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 06:36:19,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-09 06:36:19,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 109 [2025-03-09 06:36:19,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 97 transitions, 314 flow. Second operand has 23 states, 23 states have (on average 41.21739130434783) internal successors, (948), 23 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:19,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:19,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 109 [2025-03-09 06:36:19,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:20,263 INFO L124 PetriNetUnfolderBase]: 439/1329 cut-off events. [2025-03-09 06:36:20,263 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2025-03-09 06:36:20,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2316 conditions, 1329 events. 439/1329 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8553 event pairs, 396 based on Foata normal form. 3/1197 useless extension candidates. Maximal degree in co-relation 2181. Up to 857 conditions per place. [2025-03-09 06:36:20,270 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 44 selfloop transitions, 21 changer transitions 0/103 dead transitions. [2025-03-09 06:36:20,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 103 transitions, 498 flow [2025-03-09 06:36:20,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 06:36:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 06:36:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 908 transitions. [2025-03-09 06:36:20,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3966797728265618 [2025-03-09 06:36:20,274 INFO L175 Difference]: Start difference. First operand has 112 places, 97 transitions, 314 flow. Second operand 21 states and 908 transitions. [2025-03-09 06:36:20,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 103 transitions, 498 flow [2025-03-09 06:36:20,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 103 transitions, 488 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 06:36:20,279 INFO L231 Difference]: Finished difference. Result has 131 places, 103 transitions, 415 flow [2025-03-09 06:36:20,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=415, PETRI_PLACES=131, PETRI_TRANSITIONS=103} [2025-03-09 06:36:20,280 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 43 predicate places. [2025-03-09 06:36:20,280 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 103 transitions, 415 flow [2025-03-09 06:36:20,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 41.21739130434783) internal successors, (948), 23 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:20,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:20,280 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:20,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 06:36:20,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:36:20,483 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:36:20,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:20,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1560207439, now seen corresponding path program 3 times [2025-03-09 06:36:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:20,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256921885] [2025-03-09 06:36:20,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:36:20,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:20,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 11 equivalence classes. [2025-03-09 06:36:20,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 06:36:20,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 06:36:20,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:36:20,552 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:36:20,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 06:36:20,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 06:36:20,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:20,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:36:20,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:36:20,598 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:36:20,599 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-03-09 06:36:20,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-03-09 06:36:20,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-03-09 06:36:20,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-03-09 06:36:20,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-03-09 06:36:20,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-03-09 06:36:20,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 19 remaining) [2025-03-09 06:36:20,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-03-09 06:36:20,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-03-09 06:36:20,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-03-09 06:36:20,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-03-09 06:36:20,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-03-09 06:36:20,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-03-09 06:36:20,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-03-09 06:36:20,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-03-09 06:36:20,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-03-09 06:36:20,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-03-09 06:36:20,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-03-09 06:36:20,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-03-09 06:36:20,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:36:20,601 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2025-03-09 06:36:20,603 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:36:20,603 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 06:36:20,633 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 06:36:20,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 154 transitions, 324 flow [2025-03-09 06:36:20,652 INFO L124 PetriNetUnfolderBase]: 59/265 cut-off events. [2025-03-09 06:36:20,652 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 06:36:20,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 265 events. 59/265 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1208 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 157. Up to 12 conditions per place. [2025-03-09 06:36:20,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 154 transitions, 324 flow [2025-03-09 06:36:20,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 154 transitions, 324 flow [2025-03-09 06:36:20,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:36:20,661 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;@2d05a5cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:36:20,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-09 06:36:20,663 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:36:20,663 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-09 06:36:20,663 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:36:20,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:20,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 06:36:20,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-09 06:36:20,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:20,663 INFO L85 PathProgramCache]: Analyzing trace with hash 798845, now seen corresponding path program 1 times [2025-03-09 06:36:20,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:20,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131813418] [2025-03-09 06:36:20,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:20,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:20,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:36:20,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:36:20,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:20,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:20,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:20,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131813418] [2025-03-09 06:36:20,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131813418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:20,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:20,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:36:20,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719533209] [2025-03-09 06:36:20,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:20,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:36:20,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:20,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:36:20,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:36:20,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2025-03-09 06:36:20,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 154 transitions, 324 flow. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:20,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:20,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2025-03-09 06:36:20,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:23,078 INFO L124 PetriNetUnfolderBase]: 17181/36179 cut-off events. [2025-03-09 06:36:23,078 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2025-03-09 06:36:23,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61897 conditions, 36179 events. 17181/36179 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 362484 event pairs, 15876 based on Foata normal form. 6829/38985 useless extension candidates. Maximal degree in co-relation 50322. Up to 25614 conditions per place. [2025-03-09 06:36:23,229 INFO L140 encePairwiseOnDemand]: 118/154 looper letters, 68 selfloop transitions, 3 changer transitions 0/126 dead transitions. [2025-03-09 06:36:23,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 126 transitions, 410 flow [2025-03-09 06:36:23,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:36:23,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:36:23,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 324 transitions. [2025-03-09 06:36:23,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525974025974026 [2025-03-09 06:36:23,232 INFO L175 Difference]: Start difference. First operand has 123 places, 154 transitions, 324 flow. Second operand 4 states and 324 transitions. [2025-03-09 06:36:23,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 126 transitions, 410 flow [2025-03-09 06:36:23,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 410 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:36:23,234 INFO L231 Difference]: Finished difference. Result has 128 places, 126 transitions, 288 flow [2025-03-09 06:36:23,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=128, PETRI_TRANSITIONS=126} [2025-03-09 06:36:23,237 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 5 predicate places. [2025-03-09 06:36:23,237 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 126 transitions, 288 flow [2025-03-09 06:36:23,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:23,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:23,237 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 06:36:23,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:36:23,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-09 06:36:23,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:23,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1970718285, now seen corresponding path program 1 times [2025-03-09 06:36:23,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:23,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892539453] [2025-03-09 06:36:23,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:23,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:23,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:36:23,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:36:23,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:23,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:23,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:23,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892539453] [2025-03-09 06:36:23,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892539453] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:36:23,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271566649] [2025-03-09 06:36:23,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:23,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:36:23,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:36:23,293 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:36:23,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 06:36:23,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:36:23,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:36:23,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:23,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:23,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:36:23,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:36:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:23,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:36:23,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271566649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:23,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:36:23,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 06:36:23,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711527596] [2025-03-09 06:36:23,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:23,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:36:23,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:23,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:36:23,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:36:23,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2025-03-09 06:36:23,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 126 transitions, 288 flow. Second operand has 6 states, 6 states have (on average 55.833333333333336) internal successors, (335), 6 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:23,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:23,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2025-03-09 06:36:23,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:25,237 INFO L124 PetriNetUnfolderBase]: 17181/36178 cut-off events. [2025-03-09 06:36:25,238 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-03-09 06:36:25,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61907 conditions, 36178 events. 17181/36178 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 362552 event pairs, 15876 based on Foata normal form. 1/32156 useless extension candidates. Maximal degree in co-relation 61888. Up to 25609 conditions per place. [2025-03-09 06:36:25,476 INFO L140 encePairwiseOnDemand]: 149/154 looper letters, 64 selfloop transitions, 6 changer transitions 0/125 dead transitions. [2025-03-09 06:36:25,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 125 transitions, 424 flow [2025-03-09 06:36:25,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:36:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:36:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 401 transitions. [2025-03-09 06:36:25,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43398268398268397 [2025-03-09 06:36:25,481 INFO L175 Difference]: Start difference. First operand has 128 places, 126 transitions, 288 flow. Second operand 6 states and 401 transitions. [2025-03-09 06:36:25,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 125 transitions, 424 flow [2025-03-09 06:36:25,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 125 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:36:25,485 INFO L231 Difference]: Finished difference. Result has 131 places, 125 transitions, 294 flow [2025-03-09 06:36:25,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=131, PETRI_TRANSITIONS=125} [2025-03-09 06:36:25,487 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 8 predicate places. [2025-03-09 06:36:25,487 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 125 transitions, 294 flow [2025-03-09 06:36:25,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.833333333333336) internal successors, (335), 6 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:25,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:25,488 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-09 06:36:25,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:36:25,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-09 06:36:25,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-09 06:36:25,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash -962723995, now seen corresponding path program 1 times [2025-03-09 06:36:25,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:25,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815945763] [2025-03-09 06:36:25,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:25,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:25,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:36:25,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:36:25,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:25,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:36:25,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:25,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815945763] [2025-03-09 06:36:25,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815945763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:25,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:25,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:36:25,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783939083] [2025-03-09 06:36:25,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:25,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:36:25,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:25,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:36:25,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:36:25,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2025-03-09 06:36:25,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 125 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:25,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:25,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2025-03-09 06:36:25,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:27,533 INFO L124 PetriNetUnfolderBase]: 17181/36177 cut-off events. [2025-03-09 06:36:27,533 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-09 06:36:27,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61909 conditions, 36177 events. 17181/36177 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 362533 event pairs, 15876 based on Foata normal form. 1/32156 useless extension candidates. Maximal degree in co-relation 61884. Up to 25612 conditions per place. [2025-03-09 06:36:27,719 INFO L140 encePairwiseOnDemand]: 151/154 looper letters, 65 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2025-03-09 06:36:27,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 124 transitions, 428 flow [2025-03-09 06:36:27,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:36:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:36:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2025-03-09 06:36:27,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5043290043290043 [2025-03-09 06:36:27,720 INFO L175 Difference]: Start difference. First operand has 131 places, 125 transitions, 294 flow. Second operand 3 states and 233 transitions. [2025-03-09 06:36:27,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 124 transitions, 428 flow [2025-03-09 06:36:27,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 124 transitions, 406 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-09 06:36:27,723 INFO L231 Difference]: Finished difference. Result has 126 places, 124 transitions, 276 flow [2025-03-09 06:36:27,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=126, PETRI_TRANSITIONS=124} [2025-03-09 06:36:27,723 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 3 predicate places. [2025-03-09 06:36:27,723 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 124 transitions, 276 flow [2025-03-09 06:36:27,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:27,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:27,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:27,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 06:36:27,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-09 06:36:27,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:27,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1758476043, now seen corresponding path program 1 times [2025-03-09 06:36:27,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:27,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931408727] [2025-03-09 06:36:27,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:27,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:27,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:36:27,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:36:27,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:27,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:27,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:27,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931408727] [2025-03-09 06:36:27,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931408727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:36:27,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580892918] [2025-03-09 06:36:27,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:27,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:36:27,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:36:27,775 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:36:27,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 06:36:27,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:36:27,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:36:27,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:27,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:27,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:36:27,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:36:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:27,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:36:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:27,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580892918] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:36:27,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:36:27,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 06:36:27,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79180377] [2025-03-09 06:36:27,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:36:27,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:36:27,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:27,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:36:27,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:36:27,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2025-03-09 06:36:27,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 124 transitions, 276 flow. Second operand has 10 states, 10 states have (on average 56.3) internal successors, (563), 10 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:27,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:27,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2025-03-09 06:36:27,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:29,854 INFO L124 PetriNetUnfolderBase]: 17181/36181 cut-off events. [2025-03-09 06:36:29,855 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-03-09 06:36:29,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61912 conditions, 36181 events. 17181/36181 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 362427 event pairs, 15876 based on Foata normal form. 2/32162 useless extension candidates. Maximal degree in co-relation 61877. Up to 25610 conditions per place. [2025-03-09 06:36:30,032 INFO L140 encePairwiseOnDemand]: 150/154 looper letters, 65 selfloop transitions, 7 changer transitions 0/127 dead transitions. [2025-03-09 06:36:30,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 127 transitions, 435 flow [2025-03-09 06:36:30,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:36:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:36:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 459 transitions. [2025-03-09 06:36:30,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42578849721706863 [2025-03-09 06:36:30,034 INFO L175 Difference]: Start difference. First operand has 126 places, 124 transitions, 276 flow. Second operand 7 states and 459 transitions. [2025-03-09 06:36:30,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 127 transitions, 435 flow [2025-03-09 06:36:30,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 127 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:36:30,037 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 302 flow [2025-03-09 06:36:30,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=302, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2025-03-09 06:36:30,037 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 9 predicate places. [2025-03-09 06:36:30,037 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 302 flow [2025-03-09 06:36:30,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 56.3) internal successors, (563), 10 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:30,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:30,038 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:30,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 06:36:30,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:36:30,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-09 06:36:30,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:30,239 INFO L85 PathProgramCache]: Analyzing trace with hash -550664907, now seen corresponding path program 2 times [2025-03-09 06:36:30,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:30,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637635220] [2025-03-09 06:36:30,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:36:30,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:30,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-09 06:36:30,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-09 06:36:30,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:36:30,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:30,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 06:36:30,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:30,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637635220] [2025-03-09 06:36:30,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637635220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:30,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:30,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:36:30,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062546432] [2025-03-09 06:36:30,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:30,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:36:30,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:30,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:36:30,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:36:30,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 154 [2025-03-09 06:36:30,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 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-09 06:36:30,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:30,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 154 [2025-03-09 06:36:30,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:32,229 INFO L124 PetriNetUnfolderBase]: 18847/38258 cut-off events. [2025-03-09 06:36:32,230 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-03-09 06:36:32,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66662 conditions, 38258 events. 18847/38258 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 1083. Compared 376127 event pairs, 8622 based on Foata normal form. 19/34116 useless extension candidates. Maximal degree in co-relation 66622. Up to 28225 conditions per place. [2025-03-09 06:36:32,398 INFO L140 encePairwiseOnDemand]: 148/154 looper letters, 111 selfloop transitions, 3 changer transitions 0/166 dead transitions. [2025-03-09 06:36:32,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 166 transitions, 608 flow [2025-03-09 06:36:32,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:36:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:36:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 328 transitions. [2025-03-09 06:36:32,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5324675324675324 [2025-03-09 06:36:32,400 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 302 flow. Second operand 4 states and 328 transitions. [2025-03-09 06:36:32,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 166 transitions, 608 flow [2025-03-09 06:36:32,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 166 transitions, 604 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:36:32,402 INFO L231 Difference]: Finished difference. Result has 135 places, 129 transitions, 322 flow [2025-03-09 06:36:32,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=135, PETRI_TRANSITIONS=129} [2025-03-09 06:36:32,403 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 12 predicate places. [2025-03-09 06:36:32,403 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 129 transitions, 322 flow [2025-03-09 06:36:32,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 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-09 06:36:32,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:32,403 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:32,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 06:36:32,403 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-09 06:36:32,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:32,403 INFO L85 PathProgramCache]: Analyzing trace with hash 214656594, now seen corresponding path program 1 times [2025-03-09 06:36:32,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:32,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969012142] [2025-03-09 06:36:32,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:32,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:32,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:36:32,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:36:32,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:32,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:32,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:32,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969012142] [2025-03-09 06:36:32,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969012142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:36:32,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467224669] [2025-03-09 06:36:32,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:32,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:36:32,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:36:32,494 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:36:32,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 06:36:32,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:36:32,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:36:32,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:32,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:32,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:36:32,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:36:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:32,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:36:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:32,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467224669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:36:32,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:36:32,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-09 06:36:32,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979715428] [2025-03-09 06:36:32,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:36:32,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 06:36:32,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:32,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 06:36:32,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-09 06:36:32,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2025-03-09 06:36:32,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 129 transitions, 322 flow. Second operand has 18 states, 18 states have (on average 56.27777777777778) internal successors, (1013), 18 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:32,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:32,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2025-03-09 06:36:32,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:35,000 INFO L124 PetriNetUnfolderBase]: 17179/36363 cut-off events. [2025-03-09 06:36:35,000 INFO L125 PetriNetUnfolderBase]: For 902/1609 co-relation queries the response was YES. [2025-03-09 06:36:35,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62931 conditions, 36363 events. 17179/36363 cut-off events. For 902/1609 co-relation queries the response was YES. Maximal size of possible extension queue 1051. Compared 365406 event pairs, 15876 based on Foata normal form. 21/32715 useless extension candidates. Maximal degree in co-relation 62854. Up to 25621 conditions per place. [2025-03-09 06:36:35,230 INFO L140 encePairwiseOnDemand]: 150/154 looper letters, 66 selfloop transitions, 15 changer transitions 0/137 dead transitions. [2025-03-09 06:36:35,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 137 transitions, 532 flow [2025-03-09 06:36:35,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 06:36:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 06:36:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 909 transitions. [2025-03-09 06:36:35,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3935064935064935 [2025-03-09 06:36:35,233 INFO L175 Difference]: Start difference. First operand has 135 places, 129 transitions, 322 flow. Second operand 15 states and 909 transitions. [2025-03-09 06:36:35,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 137 transitions, 532 flow [2025-03-09 06:36:35,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 137 transitions, 530 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:36:35,237 INFO L231 Difference]: Finished difference. Result has 152 places, 137 transitions, 417 flow [2025-03-09 06:36:35,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=417, PETRI_PLACES=152, PETRI_TRANSITIONS=137} [2025-03-09 06:36:35,238 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 29 predicate places. [2025-03-09 06:36:35,238 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 137 transitions, 417 flow [2025-03-09 06:36:35,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 56.27777777777778) internal successors, (1013), 18 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:35,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:35,239 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:35,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 06:36:35,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:36:35,440 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-09 06:36:35,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:35,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1900818990, now seen corresponding path program 2 times [2025-03-09 06:36:35,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:35,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059735190] [2025-03-09 06:36:35,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:36:35,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:35,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-09 06:36:35,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 32 statements. [2025-03-09 06:36:35,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:36:35,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-09 06:36:35,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:35,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059735190] [2025-03-09 06:36:35,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059735190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:35,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:35,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:36:35,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003794939] [2025-03-09 06:36:35,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:35,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:36:35,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:35,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:36:35,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:36:35,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 154 [2025-03-09 06:36:35,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 137 transitions, 417 flow. Second operand has 6 states, 6 states have (on average 56.0) internal successors, (336), 6 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:35,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:35,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 154 [2025-03-09 06:36:35,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:37,776 INFO L124 PetriNetUnfolderBase]: 17760/34257 cut-off events. [2025-03-09 06:36:37,776 INFO L125 PetriNetUnfolderBase]: For 1573/1573 co-relation queries the response was YES. [2025-03-09 06:36:37,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62825 conditions, 34257 events. 17760/34257 cut-off events. For 1573/1573 co-relation queries the response was YES. Maximal size of possible extension queue 1035. Compared 325751 event pairs, 665 based on Foata normal form. 361/31466 useless extension candidates. Maximal degree in co-relation 62724. Up to 21866 conditions per place. [2025-03-09 06:36:37,972 INFO L140 encePairwiseOnDemand]: 149/154 looper letters, 187 selfloop transitions, 6 changer transitions 0/245 dead transitions. [2025-03-09 06:36:37,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 245 transitions, 1017 flow [2025-03-09 06:36:37,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:36:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:36:37,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 505 transitions. [2025-03-09 06:36:37,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5465367965367965 [2025-03-09 06:36:37,974 INFO L175 Difference]: Start difference. First operand has 152 places, 137 transitions, 417 flow. Second operand 6 states and 505 transitions. [2025-03-09 06:36:37,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 245 transitions, 1017 flow [2025-03-09 06:36:37,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 245 transitions, 1007 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 06:36:37,979 INFO L231 Difference]: Finished difference. Result has 152 places, 136 transitions, 415 flow [2025-03-09 06:36:37,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=415, PETRI_PLACES=152, PETRI_TRANSITIONS=136} [2025-03-09 06:36:37,981 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 29 predicate places. [2025-03-09 06:36:37,981 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 136 transitions, 415 flow [2025-03-09 06:36:37,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.0) internal successors, (336), 6 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:37,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:37,981 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:37,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 06:36:37,981 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-09 06:36:37,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:37,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1204154170, now seen corresponding path program 1 times [2025-03-09 06:36:37,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:37,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041135926] [2025-03-09 06:36:37,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:37,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:37,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 06:36:37,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 06:36:37,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:37,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:38,029 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-09 06:36:38,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:38,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041135926] [2025-03-09 06:36:38,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041135926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:38,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:38,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:36:38,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469811708] [2025-03-09 06:36:38,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:38,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:36:38,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:38,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:36:38,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:36:38,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 154 [2025-03-09 06:36:38,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 136 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:38,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:38,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 154 [2025-03-09 06:36:38,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:40,361 INFO L124 PetriNetUnfolderBase]: 17480/33341 cut-off events. [2025-03-09 06:36:40,361 INFO L125 PetriNetUnfolderBase]: For 2858/2858 co-relation queries the response was YES. [2025-03-09 06:36:40,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62101 conditions, 33341 events. 17480/33341 cut-off events. For 2858/2858 co-relation queries the response was YES. Maximal size of possible extension queue 979. Compared 311697 event pairs, 1044 based on Foata normal form. 361/31013 useless extension candidates. Maximal degree in co-relation 62004. Up to 23352 conditions per place. [2025-03-09 06:36:40,597 INFO L140 encePairwiseOnDemand]: 149/154 looper letters, 150 selfloop transitions, 6 changer transitions 0/208 dead transitions. [2025-03-09 06:36:40,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 208 transitions, 869 flow [2025-03-09 06:36:40,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:36:40,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:36:40,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2025-03-09 06:36:40,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5811688311688312 [2025-03-09 06:36:40,599 INFO L175 Difference]: Start difference. First operand has 152 places, 136 transitions, 415 flow. Second operand 4 states and 358 transitions. [2025-03-09 06:36:40,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 208 transitions, 869 flow [2025-03-09 06:36:40,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 208 transitions, 853 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-09 06:36:40,622 INFO L231 Difference]: Finished difference. Result has 150 places, 136 transitions, 415 flow [2025-03-09 06:36:40,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=415, PETRI_PLACES=150, PETRI_TRANSITIONS=136} [2025-03-09 06:36:40,622 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 27 predicate places. [2025-03-09 06:36:40,622 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 136 transitions, 415 flow [2025-03-09 06:36:40,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:40,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:40,623 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:40,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 06:36:40,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-09 06:36:40,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:40,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1213069262, now seen corresponding path program 1 times [2025-03-09 06:36:40,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:40,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612857128] [2025-03-09 06:36:40,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:40,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:40,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 06:36:40,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 06:36:40,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:40,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:40,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:40,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612857128] [2025-03-09 06:36:40,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612857128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:36:40,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692915886] [2025-03-09 06:36:40,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:40,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:36:40,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:36:40,888 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:36:40,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 06:36:40,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 06:36:40,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 06:36:40,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:40,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:40,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:36:40,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:36:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:41,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:36:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:41,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692915886] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:36:41,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:36:41,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-03-09 06:36:41,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303903429] [2025-03-09 06:36:41,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:36:41,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 06:36:41,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:41,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 06:36:41,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-09 06:36:41,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2025-03-09 06:36:41,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 136 transitions, 415 flow. Second operand has 23 states, 23 states have (on average 56.43478260869565) internal successors, (1298), 23 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:41,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:41,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2025-03-09 06:36:41,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:43,749 INFO L124 PetriNetUnfolderBase]: 17179/36140 cut-off events. [2025-03-09 06:36:43,749 INFO L125 PetriNetUnfolderBase]: For 3249/3249 co-relation queries the response was YES. [2025-03-09 06:36:43,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63496 conditions, 36140 events. 17179/36140 cut-off events. For 3249/3249 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 361132 event pairs, 15876 based on Foata normal form. 3/32465 useless extension candidates. Maximal degree in co-relation 63365. Up to 25616 conditions per place. [2025-03-09 06:36:43,932 INFO L140 encePairwiseOnDemand]: 150/154 looper letters, 67 selfloop transitions, 21 changer transitions 0/142 dead transitions. [2025-03-09 06:36:43,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 142 transitions, 645 flow [2025-03-09 06:36:43,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 06:36:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 06:36:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1244 transitions. [2025-03-09 06:36:43,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3846629560915275 [2025-03-09 06:36:43,934 INFO L175 Difference]: Start difference. First operand has 150 places, 136 transitions, 415 flow. Second operand 21 states and 1244 transitions. [2025-03-09 06:36:43,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 142 transitions, 645 flow [2025-03-09 06:36:43,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 142 transitions, 637 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:36:43,938 INFO L231 Difference]: Finished difference. Result has 171 places, 142 transitions, 518 flow [2025-03-09 06:36:43,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=518, PETRI_PLACES=171, PETRI_TRANSITIONS=142} [2025-03-09 06:36:43,938 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 48 predicate places. [2025-03-09 06:36:43,938 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 142 transitions, 518 flow [2025-03-09 06:36:43,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 56.43478260869565) internal successors, (1298), 23 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:43,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:43,939 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:43,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 06:36:44,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 06:36:44,140 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-09 06:36:44,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:44,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2032282280, now seen corresponding path program 2 times [2025-03-09 06:36:44,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:44,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121692883] [2025-03-09 06:36:44,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:36:44,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:44,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 06:36:44,171 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-03-09 06:36:44,172 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:36:44,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:44,720 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 06:36:44,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:44,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121692883] [2025-03-09 06:36:44,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121692883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:44,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:44,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:36:44,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913878704] [2025-03-09 06:36:44,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:44,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:36:44,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:44,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:36:44,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:36:44,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2025-03-09 06:36:44,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 142 transitions, 518 flow. Second operand has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:44,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:44,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2025-03-09 06:36:44,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:47,904 INFO L124 PetriNetUnfolderBase]: 21232/43257 cut-off events. [2025-03-09 06:36:47,905 INFO L125 PetriNetUnfolderBase]: For 2599/2599 co-relation queries the response was YES. [2025-03-09 06:36:48,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77331 conditions, 43257 events. 21232/43257 cut-off events. For 2599/2599 co-relation queries the response was YES. Maximal size of possible extension queue 1307. Compared 438865 event pairs, 2820 based on Foata normal form. 544/39989 useless extension candidates. Maximal degree in co-relation 77171. Up to 23250 conditions per place. [2025-03-09 06:36:48,236 INFO L140 encePairwiseOnDemand]: 146/154 looper letters, 238 selfloop transitions, 11 changer transitions 0/301 dead transitions. [2025-03-09 06:36:48,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 301 transitions, 1404 flow [2025-03-09 06:36:48,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:36:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:36:48,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 559 transitions. [2025-03-09 06:36:48,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.604978354978355 [2025-03-09 06:36:48,238 INFO L175 Difference]: Start difference. First operand has 171 places, 142 transitions, 518 flow. Second operand 6 states and 559 transitions. [2025-03-09 06:36:48,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 301 transitions, 1404 flow [2025-03-09 06:36:48,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 301 transitions, 1361 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-03-09 06:36:48,244 INFO L231 Difference]: Finished difference. Result has 167 places, 154 transitions, 558 flow [2025-03-09 06:36:48,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=558, PETRI_PLACES=167, PETRI_TRANSITIONS=154} [2025-03-09 06:36:48,244 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 44 predicate places. [2025-03-09 06:36:48,244 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 154 transitions, 558 flow [2025-03-09 06:36:48,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:48,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:48,245 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:36:48,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 06:36:48,245 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-09 06:36:48,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:48,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1812412296, now seen corresponding path program 1 times [2025-03-09 06:36:48,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:48,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780702837] [2025-03-09 06:36:48,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:48,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:48,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 06:36:48,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 06:36:48,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:48,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:36:48,273 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:36:48,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 06:36:48,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 06:36:48,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:48,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:36:48,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:36:48,298 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:36:48,298 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-03-09 06:36:48,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2025-03-09 06:36:48,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2025-03-09 06:36:48,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2025-03-09 06:36:48,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 06:36:48,301 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:36:48,301 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:36:48,301 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 06:36:48,333 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 06:36:48,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 199 transitions, 425 flow [2025-03-09 06:36:48,361 INFO L124 PetriNetUnfolderBase]: 86/394 cut-off events. [2025-03-09 06:36:48,361 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-09 06:36:48,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 394 events. 86/394 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1892 event pairs, 1 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 274. Up to 16 conditions per place. [2025-03-09 06:36:48,364 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 199 transitions, 425 flow [2025-03-09 06:36:48,369 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 199 transitions, 425 flow [2025-03-09 06:36:48,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:36:48,370 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;@2d05a5cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:36:48,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-09 06:36:48,373 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:36:48,374 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-09 06:36:48,374 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:36:48,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:48,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 06:36:48,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-09 06:36:48,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:48,374 INFO L85 PathProgramCache]: Analyzing trace with hash 996452, now seen corresponding path program 1 times [2025-03-09 06:36:48,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:48,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736832737] [2025-03-09 06:36:48,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:48,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:48,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:36:48,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:36:48,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:48,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:36:48,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:48,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736832737] [2025-03-09 06:36:48,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736832737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:48,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:48,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:36:48,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811101273] [2025-03-09 06:36:48,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:48,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:36:48,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:48,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:36:48,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:36:48,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 199 [2025-03-09 06:36:48,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 199 transitions, 425 flow. Second operand has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:36:48,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:48,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 199 [2025-03-09 06:36:48,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand