./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:47:11,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:47:11,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:47:11,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:47:11,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:47:11,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:47:11,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:47:11,307 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:47:11,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:47:11,307 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:47:11,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:47:11,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:47:11,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:47:11,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:47:11,309 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:47:11,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:47:11,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:47:11,309 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:47:11,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:47:11,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:47:11,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:47:11,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:47:11,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:47:11,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:47:11,310 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:47:11,310 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:47:11,310 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:47:11,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:47:11,310 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:47:11,310 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:47:11,311 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:47:11,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:47:11,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:47:11,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:47:11,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:47:11,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:47:11,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:47:11,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:47:11,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:47:11,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:47:11,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:47:11,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:47:11,312 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:47:11,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:47:11,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:47:11,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:47:11,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:47:11,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:47:11,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:47:11,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:47:11,312 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-jdk21/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 -> 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 [2025-01-10 06:47:11,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:47:11,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:47:11,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:47:11,550 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:47:11,550 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:47:11,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2025-01-10 06:47:12,754 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed05e9f6b/ea2dadecb3154417ab9670b88a377877/FLAG1885f23cb [2025-01-10 06:47:13,099 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:47:13,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2025-01-10 06:47:13,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed05e9f6b/ea2dadecb3154417ab9670b88a377877/FLAG1885f23cb [2025-01-10 06:47:13,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed05e9f6b/ea2dadecb3154417ab9670b88a377877 [2025-01-10 06:47:13,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:47:13,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:47:13,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:47:13,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:47:13,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:47:13,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:47:13" (1/1) ... [2025-01-10 06:47:13,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@116a02a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:13, skipping insertion in model container [2025-01-10 06:47:13,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:47:13" (1/1) ... [2025-01-10 06:47:13,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:47:13,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:47:13,496 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:47:13,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:47:13,605 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:47:13,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:13 WrapperNode [2025-01-10 06:47:13,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:47:13,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:47:13,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:47:13,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:47:13,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:13" (1/1) ... [2025-01-10 06:47:13,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:13" (1/1) ... [2025-01-10 06:47:13,639 INFO L138 Inliner]: procedures = 271, calls = 110, calls flagged for inlining = 7, calls inlined = 8, statements flattened = 276 [2025-01-10 06:47:13,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:47:13,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:47:13,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:47:13,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:47:13,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:13" (1/1) ... [2025-01-10 06:47:13,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:13" (1/1) ... [2025-01-10 06:47:13,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:13" (1/1) ... [2025-01-10 06:47:13,668 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 5, 70, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 5 writes are split as follows [0, 0, 4, 1]. [2025-01-10 06:47:13,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:13" (1/1) ... [2025-01-10 06:47:13,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:13" (1/1) ... [2025-01-10 06:47:13,674 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:13" (1/1) ... [2025-01-10 06:47:13,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:13" (1/1) ... [2025-01-10 06:47:13,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:13" (1/1) ... [2025-01-10 06:47:13,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:13" (1/1) ... [2025-01-10 06:47:13,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:13" (1/1) ... [2025-01-10 06:47:13,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:47:13,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:47:13,682 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:47:13,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:47:13,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:13" (1/1) ... [2025-01-10 06:47:13,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:47:13,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:47:13,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:47:13,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:47:13,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:47:13,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:47:13,730 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:47:13,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:47:13,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:47:13,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:47:13,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:47:13,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:47:13,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:47:13,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:47:13,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:47:13,731 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:47:13,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:47:13,731 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:47:13,731 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:47:13,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:47:13,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:47:13,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:47:13,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:47:13,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:47:13,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:47:13,733 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:47:13,846 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:47:13,848 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:47:14,229 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:47:14,230 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:47:14,556 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:47:14,557 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-01-10 06:47:14,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:47:14 BoogieIcfgContainer [2025-01-10 06:47:14,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:47:14,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:47:14,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:47:14,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:47:14,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:47:13" (1/3) ... [2025-01-10 06:47:14,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2c5c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:47:14, skipping insertion in model container [2025-01-10 06:47:14,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:13" (2/3) ... [2025-01-10 06:47:14,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2c5c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:47:14, skipping insertion in model container [2025-01-10 06:47:14,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:47:14" (3/3) ... [2025-01-10 06:47:14,563 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2025-01-10 06:47:14,574 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:47:14,575 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_76-tricky_address3_racefree.i that has 2 procedures, 91 locations, 1 initial locations, 13 loop locations, and 16 error locations. [2025-01-10 06:47:14,576 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:47:14,612 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 06:47:14,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 115 transitions, 237 flow [2025-01-10 06:47:14,676 INFO L124 PetriNetUnfolderBase]: 35/162 cut-off events. [2025-01-10 06:47:14,681 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:47:14,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 162 events. 35/162 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 642 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 100. Up to 8 conditions per place. [2025-01-10 06:47:14,685 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 115 transitions, 237 flow [2025-01-10 06:47:14,696 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 114 transitions, 235 flow [2025-01-10 06:47:14,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:47:14,714 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;@2e7eab3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:47:14,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-10 06:47:14,723 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:47:14,723 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:47:14,723 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:47:14,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:14,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:47:14,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:47:14,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:14,728 INFO L85 PathProgramCache]: Analyzing trace with hash 759524, now seen corresponding path program 1 times [2025-01-10 06:47:14,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:14,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151310384] [2025-01-10 06:47:14,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:14,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:14,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:47:14,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:47:14,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:14,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:15,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:15,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:15,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151310384] [2025-01-10 06:47:15,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151310384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:15,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:15,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:15,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658128069] [2025-01-10 06:47:15,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:15,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:15,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:15,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:15,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:15,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 115 [2025-01-10 06:47:15,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 114 transitions, 235 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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-01-10 06:47:15,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:15,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 115 [2025-01-10 06:47:15,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:15,382 INFO L124 PetriNetUnfolderBase]: 486/1501 cut-off events. [2025-01-10 06:47:15,382 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:47:15,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2481 conditions, 1501 events. 486/1501 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10108 event pairs, 440 based on Foata normal form. 278/1594 useless extension candidates. Maximal degree in co-relation 2390. Up to 973 conditions per place. [2025-01-10 06:47:15,424 INFO L140 encePairwiseOnDemand]: 89/115 looper letters, 49 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-01-10 06:47:15,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 303 flow [2025-01-10 06:47:15,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:15,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2025-01-10 06:47:15,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5456521739130434 [2025-01-10 06:47:15,440 INFO L175 Difference]: Start difference. First operand has 94 places, 114 transitions, 235 flow. Second operand 4 states and 251 transitions. [2025-01-10 06:47:15,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 303 flow [2025-01-10 06:47:15,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 96 transitions, 303 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:47:15,448 INFO L231 Difference]: Finished difference. Result has 99 places, 96 transitions, 219 flow [2025-01-10 06:47:15,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=99, PETRI_TRANSITIONS=96} [2025-01-10 06:47:15,453 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 5 predicate places. [2025-01-10 06:47:15,453 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 96 transitions, 219 flow [2025-01-10 06:47:15,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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-01-10 06:47:15,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:15,453 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:47:15,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:47:15,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:47:15,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:15,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1152947695, now seen corresponding path program 1 times [2025-01-10 06:47:15,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:15,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145791946] [2025-01-10 06:47:15,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:15,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:15,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:47:15,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:47:15,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:15,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:15,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:15,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145791946] [2025-01-10 06:47:15,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145791946] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:47:15,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117230962] [2025-01-10 06:47:15,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:15,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:47:15,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:47:15,584 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:47:15,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:47:15,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:47:15,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:47:15,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:15,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:15,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:47:15,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:47:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:15,716 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:47:15,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117230962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:15,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:47:15,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:47:15,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964753161] [2025-01-10 06:47:15,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:15,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:47:15,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:15,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:47:15,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:47:15,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 115 [2025-01-10 06:47:15,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 96 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 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-01-10 06:47:15,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:15,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 115 [2025-01-10 06:47:15,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:16,040 INFO L124 PetriNetUnfolderBase]: 486/1500 cut-off events. [2025-01-10 06:47:16,041 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:47:16,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 1500 events. 486/1500 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10110 event pairs, 440 based on Foata normal form. 1/1316 useless extension candidates. Maximal degree in co-relation 2473. Up to 968 conditions per place. [2025-01-10 06:47:16,053 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 45 selfloop transitions, 6 changer transitions 0/95 dead transitions. [2025-01-10 06:47:16,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 95 transitions, 317 flow [2025-01-10 06:47:16,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:47:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:47:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 316 transitions. [2025-01-10 06:47:16,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4579710144927536 [2025-01-10 06:47:16,056 INFO L175 Difference]: Start difference. First operand has 99 places, 96 transitions, 219 flow. Second operand 6 states and 316 transitions. [2025-01-10 06:47:16,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 95 transitions, 317 flow [2025-01-10 06:47:16,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 95 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:47:16,060 INFO L231 Difference]: Finished difference. Result has 102 places, 95 transitions, 225 flow [2025-01-10 06:47:16,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=102, PETRI_TRANSITIONS=95} [2025-01-10 06:47:16,061 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 8 predicate places. [2025-01-10 06:47:16,061 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 95 transitions, 225 flow [2025-01-10 06:47:16,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 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-01-10 06:47:16,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:16,061 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:47:16,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:47:16,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:47:16,262 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:47:16,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:16,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1381640988, now seen corresponding path program 1 times [2025-01-10 06:47:16,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:16,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657843935] [2025-01-10 06:47:16,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:16,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:16,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:47:16,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:47:16,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:16,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:16,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-01-10 06:47:16,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:16,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657843935] [2025-01-10 06:47:16,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657843935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:16,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:16,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:16,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886549007] [2025-01-10 06:47:16,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:16,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:47:16,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:16,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:47:16,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:47:16,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 115 [2025-01-10 06:47:16,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 95 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-01-10 06:47:16,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:16,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 115 [2025-01-10 06:47:16,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:16,568 INFO L124 PetriNetUnfolderBase]: 486/1499 cut-off events. [2025-01-10 06:47:16,568 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 06:47:16,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 1499 events. 486/1499 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10117 event pairs, 440 based on Foata normal form. 1/1316 useless extension candidates. Maximal degree in co-relation 2469. Up to 971 conditions per place. [2025-01-10 06:47:16,577 INFO L140 encePairwiseOnDemand]: 112/115 looper letters, 46 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2025-01-10 06:47:16,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 94 transitions, 321 flow [2025-01-10 06:47:16,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:47:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:47:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2025-01-10 06:47:16,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5246376811594203 [2025-01-10 06:47:16,580 INFO L175 Difference]: Start difference. First operand has 102 places, 95 transitions, 225 flow. Second operand 3 states and 181 transitions. [2025-01-10 06:47:16,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 94 transitions, 321 flow [2025-01-10 06:47:16,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 299 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 06:47:16,582 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 207 flow [2025-01-10 06:47:16,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2025-01-10 06:47:16,583 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 3 predicate places. [2025-01-10 06:47:16,583 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 207 flow [2025-01-10 06:47:16,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-01-10 06:47:16,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:16,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:16,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:47:16,584 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:47:16,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:16,584 INFO L85 PathProgramCache]: Analyzing trace with hash 611168606, now seen corresponding path program 1 times [2025-01-10 06:47:16,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:16,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793170582] [2025-01-10 06:47:16,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:16,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:16,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:47:16,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:47:16,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:16,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:16,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:16,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793170582] [2025-01-10 06:47:16,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793170582] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:47:16,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103446411] [2025-01-10 06:47:16,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:16,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:47:16,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:47:16,691 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:47:16,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:47:16,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:47:16,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:47:16,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:16,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:16,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:47:16,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:47:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:16,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:47:16,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:16,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103446411] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:47:16,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:47:16,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 06:47:16,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100366639] [2025-01-10 06:47:16,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:47:16,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:47:16,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:16,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:47:16,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:47:16,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 115 [2025-01-10 06:47:16,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 207 flow. Second operand has 10 states, 10 states have (on average 45.3) internal successors, (453), 10 states have internal predecessors, (453), 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-01-10 06:47:16,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:16,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 115 [2025-01-10 06:47:16,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:17,055 INFO L124 PetriNetUnfolderBase]: 486/1503 cut-off events. [2025-01-10 06:47:17,055 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-10 06:47:17,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2496 conditions, 1503 events. 486/1503 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10087 event pairs, 440 based on Foata normal form. 2/1322 useless extension candidates. Maximal degree in co-relation 2462. Up to 969 conditions per place. [2025-01-10 06:47:17,062 INFO L140 encePairwiseOnDemand]: 111/115 looper letters, 46 selfloop transitions, 7 changer transitions 0/97 dead transitions. [2025-01-10 06:47:17,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 97 transitions, 328 flow [2025-01-10 06:47:17,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:47:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:47:17,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 363 transitions. [2025-01-10 06:47:17,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4509316770186335 [2025-01-10 06:47:17,063 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 207 flow. Second operand 7 states and 363 transitions. [2025-01-10 06:47:17,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 97 transitions, 328 flow [2025-01-10 06:47:17,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 97 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:47:17,065 INFO L231 Difference]: Finished difference. Result has 103 places, 97 transitions, 233 flow [2025-01-10 06:47:17,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=233, PETRI_PLACES=103, PETRI_TRANSITIONS=97} [2025-01-10 06:47:17,066 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 9 predicate places. [2025-01-10 06:47:17,066 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 97 transitions, 233 flow [2025-01-10 06:47:17,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 45.3) internal successors, (453), 10 states have internal predecessors, (453), 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-01-10 06:47:17,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:17,067 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:17,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:47:17,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:47:17,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:47:17,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:17,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1230128770, now seen corresponding path program 2 times [2025-01-10 06:47:17,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:17,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649632226] [2025-01-10 06:47:17,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:47:17,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:17,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 06:47:17,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-01-10 06:47:17,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:47:17,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:17,327 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:47:17,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:17,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649632226] [2025-01-10 06:47:17,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649632226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:17,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:17,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:47:17,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262773319] [2025-01-10 06:47:17,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:17,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:17,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:17,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:17,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:17,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 115 [2025-01-10 06:47:17,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 97 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:17,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:17,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 115 [2025-01-10 06:47:17,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:17,559 INFO L124 PetriNetUnfolderBase]: 483/1378 cut-off events. [2025-01-10 06:47:17,560 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 06:47:17,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2378 conditions, 1378 events. 483/1378 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 9159 event pairs, 0 based on Foata normal form. 21/1266 useless extension candidates. Maximal degree in co-relation 2339. Up to 912 conditions per place. [2025-01-10 06:47:17,566 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 92 selfloop transitions, 3 changer transitions 0/136 dead transitions. [2025-01-10 06:47:17,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 136 transitions, 501 flow [2025-01-10 06:47:17,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2025-01-10 06:47:17,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2025-01-10 06:47:17,568 INFO L175 Difference]: Start difference. First operand has 103 places, 97 transitions, 233 flow. Second operand 4 states and 265 transitions. [2025-01-10 06:47:17,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 136 transitions, 501 flow [2025-01-10 06:47:17,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 136 transitions, 497 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:47:17,570 INFO L231 Difference]: Finished difference. Result has 103 places, 95 transitions, 235 flow [2025-01-10 06:47:17,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=103, PETRI_TRANSITIONS=95} [2025-01-10 06:47:17,575 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 9 predicate places. [2025-01-10 06:47:17,575 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 95 transitions, 235 flow [2025-01-10 06:47:17,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:17,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:17,576 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:17,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:47:17,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:47:17,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:17,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1034421661, now seen corresponding path program 1 times [2025-01-10 06:47:17,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:17,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850523483] [2025-01-10 06:47:17,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:17,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:17,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:47:17,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:47:17,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:17,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:47:17,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:17,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850523483] [2025-01-10 06:47:17,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850523483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:17,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:17,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:47:17,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159400985] [2025-01-10 06:47:17,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:17,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:17,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:17,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:17,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:17,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 115 [2025-01-10 06:47:17,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 95 transitions, 235 flow. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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-01-10 06:47:17,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:17,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 115 [2025-01-10 06:47:17,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:17,865 INFO L124 PetriNetUnfolderBase]: 506/1511 cut-off events. [2025-01-10 06:47:17,865 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-01-10 06:47:17,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2581 conditions, 1511 events. 506/1511 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10117 event pairs, 378 based on Foata normal form. 23/1365 useless extension candidates. Maximal degree in co-relation 2542. Up to 875 conditions per place. [2025-01-10 06:47:17,871 INFO L140 encePairwiseOnDemand]: 111/115 looper letters, 95 selfloop transitions, 3 changer transitions 0/138 dead transitions. [2025-01-10 06:47:17,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 138 transitions, 525 flow [2025-01-10 06:47:17,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2025-01-10 06:47:17,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2025-01-10 06:47:17,873 INFO L175 Difference]: Start difference. First operand has 103 places, 95 transitions, 235 flow. Second operand 4 states and 270 transitions. [2025-01-10 06:47:17,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 138 transitions, 525 flow [2025-01-10 06:47:17,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 138 transitions, 515 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:47:17,875 INFO L231 Difference]: Finished difference. Result has 102 places, 94 transitions, 233 flow [2025-01-10 06:47:17,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=102, PETRI_TRANSITIONS=94} [2025-01-10 06:47:17,876 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 8 predicate places. [2025-01-10 06:47:17,876 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 94 transitions, 233 flow [2025-01-10 06:47:17,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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-01-10 06:47:17,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:17,876 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:17,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:47:17,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:47:17,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:17,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2104441504, now seen corresponding path program 1 times [2025-01-10 06:47:17,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:17,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384406391] [2025-01-10 06:47:17,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:17,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:17,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:47:17,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:47:17,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:17,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:18,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:18,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384406391] [2025-01-10 06:47:18,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384406391] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:47:18,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623484460] [2025-01-10 06:47:18,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:18,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:47:18,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:47:18,005 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:47:18,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:47:18,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:47:18,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:47:18,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:18,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:18,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:47:18,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:47:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:18,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:47:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:18,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623484460] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:47:18,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:47:18,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-01-10 06:47:18,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972393296] [2025-01-10 06:47:18,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:47:18,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 06:47:18,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:18,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 06:47:18,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-10 06:47:18,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 115 [2025-01-10 06:47:18,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 94 transitions, 233 flow. Second operand has 18 states, 18 states have (on average 45.22222222222222) internal successors, (814), 18 states have internal predecessors, (814), 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-01-10 06:47:18,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:18,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 115 [2025-01-10 06:47:18,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:18,473 INFO L124 PetriNetUnfolderBase]: 485/1477 cut-off events. [2025-01-10 06:47:18,474 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-01-10 06:47:18,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2570 conditions, 1477 events. 485/1477 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 9708 event pairs, 440 based on Foata normal form. 4/1335 useless extension candidates. Maximal degree in co-relation 2495. Up to 947 conditions per place. [2025-01-10 06:47:18,480 INFO L140 encePairwiseOnDemand]: 111/115 looper letters, 46 selfloop transitions, 15 changer transitions 0/102 dead transitions. [2025-01-10 06:47:18,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 102 transitions, 403 flow [2025-01-10 06:47:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:47:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:47:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 725 transitions. [2025-01-10 06:47:18,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42028985507246375 [2025-01-10 06:47:18,483 INFO L175 Difference]: Start difference. First operand has 102 places, 94 transitions, 233 flow. Second operand 15 states and 725 transitions. [2025-01-10 06:47:18,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 102 transitions, 403 flow [2025-01-10 06:47:18,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 102 transitions, 397 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:47:18,485 INFO L231 Difference]: Finished difference. Result has 117 places, 102 transitions, 324 flow [2025-01-10 06:47:18,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=324, PETRI_PLACES=117, PETRI_TRANSITIONS=102} [2025-01-10 06:47:18,486 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 23 predicate places. [2025-01-10 06:47:18,486 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 102 transitions, 324 flow [2025-01-10 06:47:18,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 45.22222222222222) internal successors, (814), 18 states have internal predecessors, (814), 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-01-10 06:47:18,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:18,487 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:18,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:47:18,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:47:18,687 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:47:18,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:18,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1275947744, now seen corresponding path program 2 times [2025-01-10 06:47:18,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:18,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132094483] [2025-01-10 06:47:18,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:47:18,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:18,696 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 06:47:18,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:47:18,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:47:18,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:18,953 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:18,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:18,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132094483] [2025-01-10 06:47:18,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132094483] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:47:18,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233355175] [2025-01-10 06:47:18,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:47:18,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:47:18,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:47:18,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:47:18,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:47:19,008 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 06:47:19,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:47:19,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:47:19,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:19,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 06:47:19,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:47:19,090 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:19,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:47:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:19,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233355175] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:47:19,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:47:19,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-01-10 06:47:19,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735231266] [2025-01-10 06:47:19,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:47:19,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 06:47:19,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:19,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 06:47:19,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-10 06:47:19,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 115 [2025-01-10 06:47:19,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 102 transitions, 324 flow. Second operand has 23 states, 23 states have (on average 45.21739130434783) internal successors, (1040), 23 states have internal predecessors, (1040), 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-01-10 06:47:19,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:19,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 115 [2025-01-10 06:47:19,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:19,620 INFO L124 PetriNetUnfolderBase]: 485/1486 cut-off events. [2025-01-10 06:47:19,621 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-01-10 06:47:19,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2565 conditions, 1486 events. 485/1486 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 9712 event pairs, 440 based on Foata normal form. 3/1343 useless extension candidates. Maximal degree in co-relation 2430. Up to 947 conditions per place. [2025-01-10 06:47:19,628 INFO L140 encePairwiseOnDemand]: 111/115 looper letters, 46 selfloop transitions, 21 changer transitions 0/108 dead transitions. [2025-01-10 06:47:19,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 108 transitions, 512 flow [2025-01-10 06:47:19,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 06:47:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 06:47:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 994 transitions. [2025-01-10 06:47:19,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4115942028985507 [2025-01-10 06:47:19,631 INFO L175 Difference]: Start difference. First operand has 117 places, 102 transitions, 324 flow. Second operand 21 states and 994 transitions. [2025-01-10 06:47:19,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 108 transitions, 512 flow [2025-01-10 06:47:19,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 108 transitions, 502 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 06:47:19,634 INFO L231 Difference]: Finished difference. Result has 136 places, 108 transitions, 425 flow [2025-01-10 06:47:19,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=425, PETRI_PLACES=136, PETRI_TRANSITIONS=108} [2025-01-10 06:47:19,635 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 42 predicate places. [2025-01-10 06:47:19,635 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 108 transitions, 425 flow [2025-01-10 06:47:19,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 45.21739130434783) internal successors, (1040), 23 states have internal predecessors, (1040), 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-01-10 06:47:19,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:19,636 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:19,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:47:19,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 06:47:19,836 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:47:19,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:19,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1305161557, now seen corresponding path program 3 times [2025-01-10 06:47:19,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:19,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946338798] [2025-01-10 06:47:19,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:47:19,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:19,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 11 equivalence classes. [2025-01-10 06:47:19,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:47:19,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 06:47:19,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:47:19,900 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:47:19,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 06:47:19,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:47:19,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:19,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:47:19,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:47:19,936 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:47:19,937 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2025-01-10 06:47:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2025-01-10 06:47:19,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:47:19,940 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2025-01-10 06:47:19,942 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:47:19,942 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:47:19,974 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:47:19,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 165 transitions, 346 flow [2025-01-10 06:47:19,997 INFO L124 PetriNetUnfolderBase]: 59/278 cut-off events. [2025-01-10 06:47:19,997 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 06:47:19,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 278 events. 59/278 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1292 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 164. Up to 12 conditions per place. [2025-01-10 06:47:19,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 165 transitions, 346 flow [2025-01-10 06:47:20,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 165 transitions, 346 flow [2025-01-10 06:47:20,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:47:20,008 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;@2e7eab3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:47:20,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-01-10 06:47:20,010 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:47:20,010 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:47:20,010 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:47:20,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:20,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:47:20,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 06:47:20,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:20,010 INFO L85 PathProgramCache]: Analyzing trace with hash 923369, now seen corresponding path program 1 times [2025-01-10 06:47:20,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:20,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932331932] [2025-01-10 06:47:20,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:20,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:20,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:47:20,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:47:20,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:20,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:20,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:20,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932331932] [2025-01-10 06:47:20,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932331932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:20,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:20,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:20,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102859129] [2025-01-10 06:47:20,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:20,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:20,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:20,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:20,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:20,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 165 [2025-01-10 06:47:20,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 165 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:20,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:20,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 165 [2025-01-10 06:47:20,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:22,780 INFO L124 PetriNetUnfolderBase]: 20921/44082 cut-off events. [2025-01-10 06:47:22,781 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-01-10 06:47:22,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75381 conditions, 44082 events. 20921/44082 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 1192. Compared 449812 event pairs, 19440 based on Foata normal form. 9270/48624 useless extension candidates. Maximal degree in co-relation 59170. Up to 31185 conditions per place. [2025-01-10 06:47:23,015 INFO L140 encePairwiseOnDemand]: 129/165 looper letters, 72 selfloop transitions, 3 changer transitions 0/137 dead transitions. [2025-01-10 06:47:23,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 137 transitions, 440 flow [2025-01-10 06:47:23,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 356 transitions. [2025-01-10 06:47:23,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5393939393939394 [2025-01-10 06:47:23,119 INFO L175 Difference]: Start difference. First operand has 134 places, 165 transitions, 346 flow. Second operand 4 states and 356 transitions. [2025-01-10 06:47:23,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 137 transitions, 440 flow [2025-01-10 06:47:23,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 440 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:47:23,121 INFO L231 Difference]: Finished difference. Result has 139 places, 137 transitions, 310 flow [2025-01-10 06:47:23,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=139, PETRI_TRANSITIONS=137} [2025-01-10 06:47:23,122 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 5 predicate places. [2025-01-10 06:47:23,122 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 137 transitions, 310 flow [2025-01-10 06:47:23,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:23,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:23,122 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:47:23,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:47:23,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 06:47:23,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:23,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1739250639, now seen corresponding path program 1 times [2025-01-10 06:47:23,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:23,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014939455] [2025-01-10 06:47:23,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:23,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:23,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:47:23,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:47:23,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:23,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:23,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:23,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014939455] [2025-01-10 06:47:23,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014939455] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:47:23,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893211658] [2025-01-10 06:47:23,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:23,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:47:23,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:47:23,181 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:47:23,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:47:23,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:47:23,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:47:23,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:23,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:23,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:47:23,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:47:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:23,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:47:23,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893211658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:23,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:47:23,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:47:23,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891124797] [2025-01-10 06:47:23,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:23,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:47:23,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:23,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:47:23,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:47:23,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 165 [2025-01-10 06:47:23,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 137 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:23,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:23,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 165 [2025-01-10 06:47:23,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:25,799 INFO L124 PetriNetUnfolderBase]: 20921/44081 cut-off events. [2025-01-10 06:47:25,800 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-01-10 06:47:25,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75391 conditions, 44081 events. 20921/44081 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 1192. Compared 449720 event pairs, 19440 based on Foata normal form. 1/39354 useless extension candidates. Maximal degree in co-relation 75372. Up to 31180 conditions per place. [2025-01-10 06:47:26,040 INFO L140 encePairwiseOnDemand]: 160/165 looper letters, 68 selfloop transitions, 6 changer transitions 0/136 dead transitions. [2025-01-10 06:47:26,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 136 transitions, 454 flow [2025-01-10 06:47:26,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:47:26,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:47:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 447 transitions. [2025-01-10 06:47:26,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45151515151515154 [2025-01-10 06:47:26,042 INFO L175 Difference]: Start difference. First operand has 139 places, 137 transitions, 310 flow. Second operand 6 states and 447 transitions. [2025-01-10 06:47:26,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 136 transitions, 454 flow [2025-01-10 06:47:26,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 136 transitions, 452 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:47:26,044 INFO L231 Difference]: Finished difference. Result has 142 places, 136 transitions, 316 flow [2025-01-10 06:47:26,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=137, 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=316, PETRI_PLACES=142, PETRI_TRANSITIONS=136} [2025-01-10 06:47:26,045 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 8 predicate places. [2025-01-10 06:47:26,045 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 136 transitions, 316 flow [2025-01-10 06:47:26,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:26,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:26,045 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:47:26,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:47:26,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 06:47:26,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 06:47:26,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:26,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1917804063, now seen corresponding path program 1 times [2025-01-10 06:47:26,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:26,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275733771] [2025-01-10 06:47:26,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:26,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:26,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:47:26,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:47:26,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:26,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:47:26,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:26,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275733771] [2025-01-10 06:47:26,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275733771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:26,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:26,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:26,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062022909] [2025-01-10 06:47:26,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:26,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:47:26,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:26,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:47:26,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:47:26,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 165 [2025-01-10 06:47:26,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 136 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:26,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:26,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 165 [2025-01-10 06:47:26,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:28,511 INFO L124 PetriNetUnfolderBase]: 20921/44080 cut-off events. [2025-01-10 06:47:28,511 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-01-10 06:47:28,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75393 conditions, 44080 events. 20921/44080 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 1192. Compared 449843 event pairs, 19440 based on Foata normal form. 1/39354 useless extension candidates. Maximal degree in co-relation 75368. Up to 31183 conditions per place. [2025-01-10 06:47:28,724 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 69 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2025-01-10 06:47:28,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 135 transitions, 458 flow [2025-01-10 06:47:28,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:47:28,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:47:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2025-01-10 06:47:28,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5212121212121212 [2025-01-10 06:47:28,726 INFO L175 Difference]: Start difference. First operand has 142 places, 136 transitions, 316 flow. Second operand 3 states and 258 transitions. [2025-01-10 06:47:28,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 135 transitions, 458 flow [2025-01-10 06:47:28,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 135 transitions, 436 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 06:47:28,728 INFO L231 Difference]: Finished difference. Result has 137 places, 135 transitions, 298 flow [2025-01-10 06:47:28,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=137, PETRI_TRANSITIONS=135} [2025-01-10 06:47:28,729 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 3 predicate places. [2025-01-10 06:47:28,729 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 135 transitions, 298 flow [2025-01-10 06:47:28,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:28,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:28,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:28,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:47:28,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 06:47:28,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:28,730 INFO L85 PathProgramCache]: Analyzing trace with hash -469609549, now seen corresponding path program 1 times [2025-01-10 06:47:28,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:28,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244440264] [2025-01-10 06:47:28,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:28,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:28,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:47:28,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:47:28,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:28,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:28,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:28,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244440264] [2025-01-10 06:47:28,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244440264] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:47:28,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373553403] [2025-01-10 06:47:28,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:28,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:47:28,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:47:28,785 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:47:28,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:47:28,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:47:28,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:47:28,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:28,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:28,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:47:28,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:47:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:28,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:47:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:28,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373553403] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:47:28,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:47:28,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 06:47:28,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996694463] [2025-01-10 06:47:28,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:47:28,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:47:28,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:28,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:47:28,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:47:28,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 165 [2025-01-10 06:47:28,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 135 transitions, 298 flow. Second operand has 10 states, 10 states have (on average 63.3) internal successors, (633), 10 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:28,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:28,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 165 [2025-01-10 06:47:28,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:31,353 INFO L124 PetriNetUnfolderBase]: 20921/44084 cut-off events. [2025-01-10 06:47:31,353 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2025-01-10 06:47:31,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75396 conditions, 44084 events. 20921/44084 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 1192. Compared 449876 event pairs, 19440 based on Foata normal form. 2/39360 useless extension candidates. Maximal degree in co-relation 75361. Up to 31181 conditions per place. [2025-01-10 06:47:31,563 INFO L140 encePairwiseOnDemand]: 161/165 looper letters, 69 selfloop transitions, 7 changer transitions 0/138 dead transitions. [2025-01-10 06:47:31,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 138 transitions, 465 flow [2025-01-10 06:47:31,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:47:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:47:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 512 transitions. [2025-01-10 06:47:31,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4432900432900433 [2025-01-10 06:47:31,565 INFO L175 Difference]: Start difference. First operand has 137 places, 135 transitions, 298 flow. Second operand 7 states and 512 transitions. [2025-01-10 06:47:31,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 138 transitions, 465 flow [2025-01-10 06:47:31,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 138 transitions, 451 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:47:31,567 INFO L231 Difference]: Finished difference. Result has 143 places, 138 transitions, 324 flow [2025-01-10 06:47:31,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=324, PETRI_PLACES=143, PETRI_TRANSITIONS=138} [2025-01-10 06:47:31,567 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 9 predicate places. [2025-01-10 06:47:31,567 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 138 transitions, 324 flow [2025-01-10 06:47:31,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 63.3) internal successors, (633), 10 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:31,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:31,568 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:31,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 06:47:31,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 06:47:31,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 06:47:31,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash 256946675, now seen corresponding path program 2 times [2025-01-10 06:47:31,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:31,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692647817] [2025-01-10 06:47:31,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:47:31,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:31,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 06:47:31,782 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-01-10 06:47:31,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:47:31,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:47:31,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:31,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692647817] [2025-01-10 06:47:31,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692647817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:31,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:31,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:47:31,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604515648] [2025-01-10 06:47:31,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:31,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:31,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:31,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:31,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:31,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 165 [2025-01-10 06:47:31,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 138 transitions, 324 flow. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:31,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:31,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 165 [2025-01-10 06:47:31,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:34,509 INFO L124 PetriNetUnfolderBase]: 23016/46825 cut-off events. [2025-01-10 06:47:34,510 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-01-10 06:47:34,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81493 conditions, 46825 events. 23016/46825 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 1226. Compared 469920 event pairs, 10580 based on Foata normal form. 21/41770 useless extension candidates. Maximal degree in co-relation 81453. Up to 34473 conditions per place. [2025-01-10 06:47:34,737 INFO L140 encePairwiseOnDemand]: 159/165 looper letters, 119 selfloop transitions, 3 changer transitions 0/181 dead transitions. [2025-01-10 06:47:34,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 181 transitions, 654 flow [2025-01-10 06:47:34,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 364 transitions. [2025-01-10 06:47:34,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2025-01-10 06:47:34,739 INFO L175 Difference]: Start difference. First operand has 143 places, 138 transitions, 324 flow. Second operand 4 states and 364 transitions. [2025-01-10 06:47:34,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 181 transitions, 654 flow [2025-01-10 06:47:34,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 181 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:47:34,741 INFO L231 Difference]: Finished difference. Result has 146 places, 140 transitions, 344 flow [2025-01-10 06:47:34,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=344, PETRI_PLACES=146, PETRI_TRANSITIONS=140} [2025-01-10 06:47:34,742 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 12 predicate places. [2025-01-10 06:47:34,742 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 140 transitions, 344 flow [2025-01-10 06:47:34,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:34,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:34,742 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:34,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:47:34,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 06:47:34,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:34,743 INFO L85 PathProgramCache]: Analyzing trace with hash 2115943992, now seen corresponding path program 1 times [2025-01-10 06:47:34,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:34,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84160975] [2025-01-10 06:47:34,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:34,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:34,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:47:34,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:47:34,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:34,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:47:34,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:34,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84160975] [2025-01-10 06:47:34,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84160975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:34,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:34,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:47:34,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123001560] [2025-01-10 06:47:34,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:34,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:34,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:34,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:34,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:34,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 165 [2025-01-10 06:47:34,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 140 transitions, 344 flow. Second operand has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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-01-10 06:47:34,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:34,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 165 [2025-01-10 06:47:34,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:37,171 INFO L124 PetriNetUnfolderBase]: 21407/40857 cut-off events. [2025-01-10 06:47:37,171 INFO L125 PetriNetUnfolderBase]: For 1134/2062 co-relation queries the response was YES. [2025-01-10 06:47:37,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74117 conditions, 40857 events. 21407/40857 cut-off events. For 1134/2062 co-relation queries the response was YES. Maximal size of possible extension queue 1118. Compared 395732 event pairs, 440 based on Foata normal form. 526/37645 useless extension candidates. Maximal degree in co-relation 74076. Up to 28198 conditions per place. [2025-01-10 06:47:37,393 INFO L140 encePairwiseOnDemand]: 161/165 looper letters, 167 selfloop transitions, 3 changer transitions 0/231 dead transitions. [2025-01-10 06:47:37,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 231 transitions, 896 flow [2025-01-10 06:47:37,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 411 transitions. [2025-01-10 06:47:37,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2025-01-10 06:47:37,395 INFO L175 Difference]: Start difference. First operand has 146 places, 140 transitions, 344 flow. Second operand 4 states and 411 transitions. [2025-01-10 06:47:37,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 231 transitions, 896 flow [2025-01-10 06:47:37,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 231 transitions, 892 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:47:37,398 INFO L231 Difference]: Finished difference. Result has 147 places, 139 transitions, 346 flow [2025-01-10 06:47:37,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=346, PETRI_PLACES=147, PETRI_TRANSITIONS=139} [2025-01-10 06:47:37,400 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 13 predicate places. [2025-01-10 06:47:37,400 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 139 transitions, 346 flow [2025-01-10 06:47:37,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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-01-10 06:47:37,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:37,401 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:37,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:47:37,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 06:47:37,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1169755311, now seen corresponding path program 1 times [2025-01-10 06:47:37,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:37,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874259063] [2025-01-10 06:47:37,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:37,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:37,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:47:37,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:47:37,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:37,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:47:37,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:37,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874259063] [2025-01-10 06:47:37,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874259063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:37,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:37,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:47:37,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39235720] [2025-01-10 06:47:37,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:37,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:37,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:37,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:37,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:37,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 165 [2025-01-10 06:47:37,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 139 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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-01-10 06:47:37,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:37,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 165 [2025-01-10 06:47:37,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:40,464 INFO L124 PetriNetUnfolderBase]: 20844/43253 cut-off events. [2025-01-10 06:47:40,464 INFO L125 PetriNetUnfolderBase]: For 2073/2946 co-relation queries the response was YES. [2025-01-10 06:47:40,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77022 conditions, 43253 events. 20844/43253 cut-off events. For 2073/2946 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 437127 event pairs, 15754 based on Foata normal form. 525/39532 useless extension candidates. Maximal degree in co-relation 76981. Up to 26761 conditions per place. [2025-01-10 06:47:40,694 INFO L140 encePairwiseOnDemand]: 161/165 looper letters, 166 selfloop transitions, 3 changer transitions 0/230 dead transitions. [2025-01-10 06:47:40,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 230 transitions, 894 flow [2025-01-10 06:47:40,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:40,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 410 transitions. [2025-01-10 06:47:40,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-01-10 06:47:40,696 INFO L175 Difference]: Start difference. First operand has 147 places, 139 transitions, 346 flow. Second operand 4 states and 410 transitions. [2025-01-10 06:47:40,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 230 transitions, 894 flow [2025-01-10 06:47:40,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 230 transitions, 888 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:47:40,706 INFO L231 Difference]: Finished difference. Result has 146 places, 138 transitions, 344 flow [2025-01-10 06:47:40,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=344, PETRI_PLACES=146, PETRI_TRANSITIONS=138} [2025-01-10 06:47:40,711 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 12 predicate places. [2025-01-10 06:47:40,711 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 138 transitions, 344 flow [2025-01-10 06:47:40,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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-01-10 06:47:40,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:40,711 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:40,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:47:40,711 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 06:47:40,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:40,712 INFO L85 PathProgramCache]: Analyzing trace with hash -520638593, now seen corresponding path program 1 times [2025-01-10 06:47:40,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:40,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731248184] [2025-01-10 06:47:40,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:40,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:40,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:47:40,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:47:40,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:40,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:40,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:40,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731248184] [2025-01-10 06:47:40,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731248184] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:47:40,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118774393] [2025-01-10 06:47:40,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:40,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:47:40,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:47:40,823 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:47:40,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:47:40,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:47:40,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:47:40,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:40,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:40,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:47:40,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:47:40,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:40,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:47:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:40,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118774393] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:47:40,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:47:40,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-01-10 06:47:40,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808690192] [2025-01-10 06:47:40,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:47:40,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 06:47:40,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:40,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 06:47:40,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-10 06:47:40,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 165 [2025-01-10 06:47:40,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 138 transitions, 344 flow. Second operand has 18 states, 18 states have (on average 63.27777777777778) internal successors, (1139), 18 states have internal predecessors, (1139), 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-01-10 06:47:40,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:40,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 165 [2025-01-10 06:47:40,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:43,893 INFO L124 PetriNetUnfolderBase]: 20919/44308 cut-off events. [2025-01-10 06:47:43,894 INFO L125 PetriNetUnfolderBase]: For 2589/3453 co-relation queries the response was YES. [2025-01-10 06:47:44,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78137 conditions, 44308 events. 20919/44308 cut-off events. For 2589/3453 co-relation queries the response was YES. Maximal size of possible extension queue 1170. Compared 453541 event pairs, 19440 based on Foata normal form. 22/39995 useless extension candidates. Maximal degree in co-relation 78060. Up to 31203 conditions per place. [2025-01-10 06:47:44,118 INFO L140 encePairwiseOnDemand]: 161/165 looper letters, 70 selfloop transitions, 15 changer transitions 0/146 dead transitions. [2025-01-10 06:47:44,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 146 transitions, 562 flow [2025-01-10 06:47:44,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:47:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:47:44,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1018 transitions. [2025-01-10 06:47:44,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4113131313131313 [2025-01-10 06:47:44,120 INFO L175 Difference]: Start difference. First operand has 146 places, 138 transitions, 344 flow. Second operand 15 states and 1018 transitions. [2025-01-10 06:47:44,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 146 transitions, 562 flow [2025-01-10 06:47:44,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 146 transitions, 556 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:47:44,123 INFO L231 Difference]: Finished difference. Result has 161 places, 146 transitions, 435 flow [2025-01-10 06:47:44,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=435, PETRI_PLACES=161, PETRI_TRANSITIONS=146} [2025-01-10 06:47:44,123 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 27 predicate places. [2025-01-10 06:47:44,123 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 146 transitions, 435 flow [2025-01-10 06:47:44,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 63.27777777777778) internal successors, (1139), 18 states have internal predecessors, (1139), 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-01-10 06:47:44,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:44,124 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:44,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:47:44,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:47:44,324 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 06:47:44,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:44,325 INFO L85 PathProgramCache]: Analyzing trace with hash 805163775, now seen corresponding path program 2 times [2025-01-10 06:47:44,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:44,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502141152] [2025-01-10 06:47:44,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:47:44,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:44,333 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-10 06:47:44,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 32 statements. [2025-01-10 06:47:44,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:47:44,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-10 06:47:44,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:44,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502141152] [2025-01-10 06:47:44,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502141152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:44,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:44,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:47:44,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604654431] [2025-01-10 06:47:44,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:44,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:47:44,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:44,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:47:44,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:47:44,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 165 [2025-01-10 06:47:44,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 146 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 63.0) internal successors, (378), 6 states have internal predecessors, (378), 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-01-10 06:47:44,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:44,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 165 [2025-01-10 06:47:44,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:47,070 INFO L124 PetriNetUnfolderBase]: 21731/42337 cut-off events. [2025-01-10 06:47:47,235 INFO L125 PetriNetUnfolderBase]: For 1878/1878 co-relation queries the response was YES. [2025-01-10 06:47:47,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77181 conditions, 42337 events. 21731/42337 cut-off events. For 1878/1878 co-relation queries the response was YES. Maximal size of possible extension queue 1155. Compared 412675 event pairs, 819 based on Foata normal form. 441/39028 useless extension candidates. Maximal degree in co-relation 77080. Up to 26688 conditions per place. [2025-01-10 06:47:47,486 INFO L140 encePairwiseOnDemand]: 160/165 looper letters, 203 selfloop transitions, 6 changer transitions 0/266 dead transitions. [2025-01-10 06:47:47,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 266 transitions, 1091 flow [2025-01-10 06:47:47,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:47:47,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:47:47,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 563 transitions. [2025-01-10 06:47:47,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5686868686868687 [2025-01-10 06:47:47,488 INFO L175 Difference]: Start difference. First operand has 161 places, 146 transitions, 435 flow. Second operand 6 states and 563 transitions. [2025-01-10 06:47:47,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 266 transitions, 1091 flow [2025-01-10 06:47:47,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 266 transitions, 1081 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 06:47:47,492 INFO L231 Difference]: Finished difference. Result has 161 places, 145 transitions, 433 flow [2025-01-10 06:47:47,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=433, PETRI_PLACES=161, PETRI_TRANSITIONS=145} [2025-01-10 06:47:47,492 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 27 predicate places. [2025-01-10 06:47:47,492 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 145 transitions, 433 flow [2025-01-10 06:47:47,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.0) internal successors, (378), 6 states have internal predecessors, (378), 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-01-10 06:47:47,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:47,492 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:47,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:47:47,493 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 06:47:47,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:47,493 INFO L85 PathProgramCache]: Analyzing trace with hash -809725803, now seen corresponding path program 1 times [2025-01-10 06:47:47,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:47,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733892872] [2025-01-10 06:47:47,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:47,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:47,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 06:47:47,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 06:47:47,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:47,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-10 06:47:47,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:47,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733892872] [2025-01-10 06:47:47,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733892872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:47,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:47,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:47:47,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459751861] [2025-01-10 06:47:47,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:47,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:47,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:47,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:47,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:47,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 165 [2025-01-10 06:47:47,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 145 transitions, 433 flow. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-01-10 06:47:47,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:47,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 165 [2025-01-10 06:47:47,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:50,374 INFO L124 PetriNetUnfolderBase]: 20893/40568 cut-off events. [2025-01-10 06:47:50,374 INFO L125 PetriNetUnfolderBase]: For 3449/3449 co-relation queries the response was YES. [2025-01-10 06:47:50,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75111 conditions, 40568 events. 20893/40568 cut-off events. For 3449/3449 co-relation queries the response was YES. Maximal size of possible extension queue 1106. Compared 390742 event pairs, 885 based on Foata normal form. 441/37822 useless extension candidates. Maximal degree in co-relation 75014. Up to 28010 conditions per place. [2025-01-10 06:47:50,664 INFO L140 encePairwiseOnDemand]: 160/165 looper letters, 162 selfloop transitions, 6 changer transitions 0/225 dead transitions. [2025-01-10 06:47:50,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 225 transitions, 927 flow [2025-01-10 06:47:50,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2025-01-10 06:47:50,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.603030303030303 [2025-01-10 06:47:50,665 INFO L175 Difference]: Start difference. First operand has 161 places, 145 transitions, 433 flow. Second operand 4 states and 398 transitions. [2025-01-10 06:47:50,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 225 transitions, 927 flow [2025-01-10 06:47:50,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 225 transitions, 911 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 06:47:50,676 INFO L231 Difference]: Finished difference. Result has 159 places, 145 transitions, 433 flow [2025-01-10 06:47:50,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=433, PETRI_PLACES=159, PETRI_TRANSITIONS=145} [2025-01-10 06:47:50,677 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 25 predicate places. [2025-01-10 06:47:50,677 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 145 transitions, 433 flow [2025-01-10 06:47:50,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-01-10 06:47:50,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:50,677 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:50,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:47:50,677 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 06:47:50,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:50,678 INFO L85 PathProgramCache]: Analyzing trace with hash 673077316, now seen corresponding path program 1 times [2025-01-10 06:47:50,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:50,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371351510] [2025-01-10 06:47:50,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:50,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:50,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:47:50,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:47:50,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:50,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-10 06:47:50,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:50,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371351510] [2025-01-10 06:47:50,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371351510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:50,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:50,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:47:50,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976939813] [2025-01-10 06:47:50,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:50,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:50,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:50,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:50,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:50,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 165 [2025-01-10 06:47:50,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 145 transitions, 433 flow. Second operand has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 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-01-10 06:47:50,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:50,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 165 [2025-01-10 06:47:50,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand