./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym.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/pthread-ext/09_fmaxsym.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 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:34:15,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:34:15,538 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:34:15,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:34:15,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:34:15,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:34:15,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:34:15,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:34:15,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:34:15,567 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:34:15,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:34:15,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:34:15,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:34:15,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:34:15,569 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:34:15,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:34:15,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:34:15,569 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:34:15,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:34:15,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:34:15,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:34:15,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:34:15,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:34:15,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:34:15,570 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:34:15,570 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:34:15,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:34:15,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:34:15,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:34:15,570 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:34:15,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:34:15,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:34:15,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:34:15,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:34:15,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:34:15,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:34:15,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:34:15,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:34:15,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:34:15,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:34:15,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:34:15,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:34:15,572 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:34:15,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:34:15,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:34:15,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:34:15,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:34:15,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:34:15,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:34:15,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:34:15,572 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 -> 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 [2025-01-10 06:34:15,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:34:15,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:34:15,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:34:15,796 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:34:15,796 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:34:15,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-01-10 06:34:16,937 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4233c66b9/17bf0e1c1f6742c893ea0e530d2b4523/FLAG8ad3822d0 [2025-01-10 06:34:17,188 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:34:17,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-01-10 06:34:17,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4233c66b9/17bf0e1c1f6742c893ea0e530d2b4523/FLAG8ad3822d0 [2025-01-10 06:34:17,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4233c66b9/17bf0e1c1f6742c893ea0e530d2b4523 [2025-01-10 06:34:17,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:34:17,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:34:17,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:34:17,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:34:17,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:34:17,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:34:17" (1/1) ... [2025-01-10 06:34:17,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5d3808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:17, skipping insertion in model container [2025-01-10 06:34:17,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:34:17" (1/1) ... [2025-01-10 06:34:17,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:34:17,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:34:17,482 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:34:17,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:34:17,549 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:34:17,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:17 WrapperNode [2025-01-10 06:34:17,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:34:17,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:34:17,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:34:17,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:34:17,558 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:34:17" (1/1) ... [2025-01-10 06:34:17,568 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:34:17" (1/1) ... [2025-01-10 06:34:17,580 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2025-01-10 06:34:17,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:34:17,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:34:17,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:34:17,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:34:17,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:17" (1/1) ... [2025-01-10 06:34:17,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:17" (1/1) ... [2025-01-10 06:34:17,589 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:17" (1/1) ... [2025-01-10 06:34:17,597 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-01-10 06:34:17,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:17" (1/1) ... [2025-01-10 06:34:17,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:17" (1/1) ... [2025-01-10 06:34:17,601 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:17" (1/1) ... [2025-01-10 06:34:17,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:17" (1/1) ... [2025-01-10 06:34:17,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:17" (1/1) ... [2025-01-10 06:34:17,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:17" (1/1) ... [2025-01-10 06:34:17,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:17" (1/1) ... [2025-01-10 06:34:17,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:34:17,606 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:34:17,606 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:34:17,606 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:34:17,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:17" (1/1) ... [2025-01-10 06:34:17,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:34:17,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:17,628 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:34:17,631 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:34:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:34:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:34:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:34:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-10 06:34:17,647 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-10 06:34:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:34:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:34:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:34:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:34:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:34:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:34:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:34:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:34:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:34:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:34:17,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:34:17,649 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:34:17,733 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:34:17,734 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:34:17,922 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:34:17,922 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:34:18,033 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:34:18,034 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 06:34:18,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:34:18 BoogieIcfgContainer [2025-01-10 06:34:18,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:34:18,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:34:18,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:34:18,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:34:18,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:34:17" (1/3) ... [2025-01-10 06:34:18,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f647350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:34:18, skipping insertion in model container [2025-01-10 06:34:18,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:17" (2/3) ... [2025-01-10 06:34:18,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f647350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:34:18, skipping insertion in model container [2025-01-10 06:34:18,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:34:18" (3/3) ... [2025-01-10 06:34:18,042 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-01-10 06:34:18,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:34:18,054 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym.i that has 2 procedures, 30 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-01-10 06:34:18,055 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:34:18,089 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:34:18,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 33 transitions, 70 flow [2025-01-10 06:34:18,153 INFO L124 PetriNetUnfolderBase]: 3/35 cut-off events. [2025-01-10 06:34:18,154 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:18,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 35 events. 3/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-01-10 06:34:18,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 33 transitions, 70 flow [2025-01-10 06:34:18,158 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 33 transitions, 70 flow [2025-01-10 06:34:18,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:34:18,170 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;@164c7151, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:34:18,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-10 06:34:18,172 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:34:18,172 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:34:18,172 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:18,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:18,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:34:18,173 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:34:18,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:18,177 INFO L85 PathProgramCache]: Analyzing trace with hash 288678, now seen corresponding path program 1 times [2025-01-10 06:34:18,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:18,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752034408] [2025-01-10 06:34:18,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:18,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:18,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:34:18,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:34:18,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:18,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:18,368 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:34:18,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:18,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752034408] [2025-01-10 06:34:18,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752034408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:18,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:18,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:18,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580629657] [2025-01-10 06:34:18,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:18,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:34:18,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:18,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:34:18,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:34:18,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-01-10 06:34:18,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:34:18,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:18,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-01-10 06:34:18,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:18,487 INFO L124 PetriNetUnfolderBase]: 24/95 cut-off events. [2025-01-10 06:34:18,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:18,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 95 events. 24/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 211 event pairs, 20 based on Foata normal form. 4/88 useless extension candidates. Maximal degree in co-relation 137. Up to 64 conditions per place. [2025-01-10 06:34:18,488 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 19 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-01-10 06:34:18,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 114 flow [2025-01-10 06:34:18,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:34:18,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:34:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-01-10 06:34:18,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2025-01-10 06:34:18,499 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 70 flow. Second operand 4 states and 71 transitions. [2025-01-10 06:34:18,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 114 flow [2025-01-10 06:34:18,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:34:18,503 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 90 flow [2025-01-10 06:34:18,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2025-01-10 06:34:18,507 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2025-01-10 06:34:18,507 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 90 flow [2025-01-10 06:34:18,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:34:18,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:18,508 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:34:18,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:34:18,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:34:18,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:18,508 INFO L85 PathProgramCache]: Analyzing trace with hash 10340203, now seen corresponding path program 1 times [2025-01-10 06:34:18,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:18,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331367917] [2025-01-10 06:34:18,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:18,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:18,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:18,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:18,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:18,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:18,605 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:34:18,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:18,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331367917] [2025-01-10 06:34:18,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331367917] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:18,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938807638] [2025-01-10 06:34:18,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:18,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:18,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:18,608 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:34:18,609 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:34:18,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:18,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:18,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:18,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:18,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:34:18,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:18,711 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:34:18,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:34:18,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938807638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:18,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:34:18,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:34:18,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334468093] [2025-01-10 06:34:18,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:18,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:34:18,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:18,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:34:18,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:34:18,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-01-10 06:34:18,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 90 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:34:18,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:18,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-01-10 06:34:18,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:18,784 INFO L124 PetriNetUnfolderBase]: 24/94 cut-off events. [2025-01-10 06:34:18,784 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:34:18,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 94 events. 24/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 207 event pairs, 20 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 157. Up to 59 conditions per place. [2025-01-10 06:34:18,785 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 15 selfloop transitions, 6 changer transitions 0/32 dead transitions. [2025-01-10 06:34:18,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 128 flow [2025-01-10 06:34:18,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:34:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:34:18,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-01-10 06:34:18,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-01-10 06:34:18,787 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 90 flow. Second operand 6 states and 88 transitions. [2025-01-10 06:34:18,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 128 flow [2025-01-10 06:34:18,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:34:18,788 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 96 flow [2025-01-10 06:34:18,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2025-01-10 06:34:18,789 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2025-01-10 06:34:18,789 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 96 flow [2025-01-10 06:34:18,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:34:18,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:18,789 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:34:18,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:34:18,994 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:34:18,994 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:34:18,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:18,995 INFO L85 PathProgramCache]: Analyzing trace with hash 320546563, now seen corresponding path program 1 times [2025-01-10 06:34:18,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:18,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93646670] [2025-01-10 06:34:18,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:18,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:19,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:34:19,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:34:19,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:19,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:19,063 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:34:19,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:19,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93646670] [2025-01-10 06:34:19,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93646670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:19,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:19,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:19,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067967552] [2025-01-10 06:34:19,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:19,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:19,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:19,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:19,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:19,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-01-10 06:34:19,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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:34:19,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:19,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-01-10 06:34:19,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:19,113 INFO L124 PetriNetUnfolderBase]: 24/93 cut-off events. [2025-01-10 06:34:19,113 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 06:34:19,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 93 events. 24/93 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 211 event pairs, 20 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 153. Up to 62 conditions per place. [2025-01-10 06:34:19,114 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 16 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2025-01-10 06:34:19,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 132 flow [2025-01-10 06:34:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:19,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-01-10 06:34:19,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2025-01-10 06:34:19,115 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 96 flow. Second operand 3 states and 52 transitions. [2025-01-10 06:34:19,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 132 flow [2025-01-10 06:34:19,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 110 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 06:34:19,116 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 78 flow [2025-01-10 06:34:19,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2025-01-10 06:34:19,116 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2025-01-10 06:34:19,116 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 78 flow [2025-01-10 06:34:19,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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:34:19,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:19,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:19,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:34:19,117 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:34:19,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1191804442, now seen corresponding path program 1 times [2025-01-10 06:34:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:19,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663505950] [2025-01-10 06:34:19,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:19,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:19,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:19,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:19,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:19,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:19,163 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:34:19,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:19,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663505950] [2025-01-10 06:34:19,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663505950] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:19,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35750669] [2025-01-10 06:34:19,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:19,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:19,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:19,165 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:34:19,167 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:34:19,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:19,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:19,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:19,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:19,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:34:19,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:19,263 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:34:19,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:34:19,291 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:34:19,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35750669] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:34:19,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:34:19,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 06:34:19,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559991203] [2025-01-10 06:34:19,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:34:19,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:34:19,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:19,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:34:19,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:34:19,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-01-10 06:34:19,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 78 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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:34:19,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:19,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-01-10 06:34:19,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:19,372 INFO L124 PetriNetUnfolderBase]: 24/97 cut-off events. [2025-01-10 06:34:19,372 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-10 06:34:19,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 97 events. 24/97 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 208 event pairs, 20 based on Foata normal form. 2/90 useless extension candidates. Maximal degree in co-relation 146. Up to 60 conditions per place. [2025-01-10 06:34:19,373 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 16 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2025-01-10 06:34:19,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 139 flow [2025-01-10 06:34:19,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:34:19,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:34:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2025-01-10 06:34:19,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2025-01-10 06:34:19,375 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 78 flow. Second operand 7 states and 102 transitions. [2025-01-10 06:34:19,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 139 flow [2025-01-10 06:34:19,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 125 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:19,376 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 104 flow [2025-01-10 06:34:19,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2025-01-10 06:34:19,376 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2025-01-10 06:34:19,376 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 104 flow [2025-01-10 06:34:19,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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:34:19,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:19,377 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:19,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:34:19,582 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:34:19,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:34:19,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:19,586 INFO L85 PathProgramCache]: Analyzing trace with hash 553502662, now seen corresponding path program 2 times [2025-01-10 06:34:19,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:19,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83329312] [2025-01-10 06:34:19,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:34:19,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:19,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 06:34:19,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-01-10 06:34:19,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:34:19,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:19,639 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:34:19,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:19,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83329312] [2025-01-10 06:34:19,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83329312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:19,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:19,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:19,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979419690] [2025-01-10 06:34:19,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:19,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:19,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:19,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:19,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:19,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-01-10 06:34:19,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:34:19,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:19,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-01-10 06:34:19,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:19,689 INFO L124 PetriNetUnfolderBase]: 26/96 cut-off events. [2025-01-10 06:34:19,690 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 06:34:19,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 96 events. 26/96 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 187 event pairs, 2 based on Foata normal form. 3/96 useless extension candidates. Maximal degree in co-relation 152. Up to 53 conditions per place. [2025-01-10 06:34:19,690 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 24 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-01-10 06:34:19,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 158 flow [2025-01-10 06:34:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:19,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-01-10 06:34:19,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-01-10 06:34:19,691 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 104 flow. Second operand 3 states and 55 transitions. [2025-01-10 06:34:19,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 158 flow [2025-01-10 06:34:19,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:19,693 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 102 flow [2025-01-10 06:34:19,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2025-01-10 06:34:19,694 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2025-01-10 06:34:19,696 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 102 flow [2025-01-10 06:34:19,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:34:19,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:19,696 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 06:34:19,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:34:19,696 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:34:19,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:19,697 INFO L85 PathProgramCache]: Analyzing trace with hash -21294929, now seen corresponding path program 1 times [2025-01-10 06:34:19,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:19,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653269883] [2025-01-10 06:34:19,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:19,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:19,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:34:19,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:34:19,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:19,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:19,815 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:34:19,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:19,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653269883] [2025-01-10 06:34:19,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653269883] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:19,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570475962] [2025-01-10 06:34:19,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:19,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:19,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:19,819 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:34:19,823 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:34:19,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:34:19,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:34:19,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:19,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:19,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:34:19,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:19,910 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:34:19,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:34:19,980 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:34:19,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570475962] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:34:19,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:34:19,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-01-10 06:34:19,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711337571] [2025-01-10 06:34:19,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:34:19,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 06:34:19,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:19,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 06:34:19,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:34:19,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-01-10 06:34:19,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 102 flow. Second operand has 15 states, 15 states have (on average 12.333333333333334) internal successors, (185), 15 states have internal predecessors, (185), 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:34:19,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:19,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-01-10 06:34:19,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:20,134 INFO L124 PetriNetUnfolderBase]: 24/98 cut-off events. [2025-01-10 06:34:20,135 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-10 06:34:20,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 98 events. 24/98 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 175 event pairs, 20 based on Foata normal form. 3/93 useless extension candidates. Maximal degree in co-relation 146. Up to 60 conditions per place. [2025-01-10 06:34:20,136 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 16 selfloop transitions, 13 changer transitions 0/39 dead transitions. [2025-01-10 06:34:20,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 196 flow [2025-01-10 06:34:20,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:34:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:34:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 175 transitions. [2025-01-10 06:34:20,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40792540792540793 [2025-01-10 06:34:20,137 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 102 flow. Second operand 13 states and 175 transitions. [2025-01-10 06:34:20,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 196 flow [2025-01-10 06:34:20,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:20,139 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 175 flow [2025-01-10 06:34:20,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=175, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2025-01-10 06:34:20,140 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2025-01-10 06:34:20,140 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 175 flow [2025-01-10 06:34:20,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.333333333333334) internal successors, (185), 15 states have internal predecessors, (185), 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:34:20,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:20,140 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1] [2025-01-10 06:34:20,149 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:34:20,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:20,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:34:20,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:20,342 INFO L85 PathProgramCache]: Analyzing trace with hash -741234966, now seen corresponding path program 2 times [2025-01-10 06:34:20,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:20,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58168114] [2025-01-10 06:34:20,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:34:20,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:20,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 06:34:20,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:34:20,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:34:20,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:20,383 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:34:20,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:34:20,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:34:20,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:20,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:20,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:34:20,404 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:34:20,405 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-01-10 06:34:20,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-01-10 06:34:20,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-01-10 06:34:20,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-01-10 06:34:20,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-01-10 06:34:20,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-01-10 06:34:20,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-01-10 06:34:20,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-01-10 06:34:20,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-01-10 06:34:20,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-01-10 06:34:20,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-01-10 06:34:20,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:34:20,407 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-01-10 06:34:20,409 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:34:20,409 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:34:20,426 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:34:20,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 120 flow [2025-01-10 06:34:20,431 INFO L124 PetriNetUnfolderBase]: 5/60 cut-off events. [2025-01-10 06:34:20,431 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:34:20,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 60 events. 5/60 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 119 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 45. Up to 3 conditions per place. [2025-01-10 06:34:20,431 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 55 transitions, 120 flow [2025-01-10 06:34:20,432 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 55 transitions, 120 flow [2025-01-10 06:34:20,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:34:20,432 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;@164c7151, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:34:20,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-01-10 06:34:20,433 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:34:20,433 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:34:20,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:20,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:20,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:34:20,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:20,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:20,434 INFO L85 PathProgramCache]: Analyzing trace with hash 343293, now seen corresponding path program 1 times [2025-01-10 06:34:20,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:20,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339226989] [2025-01-10 06:34:20,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:20,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:20,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:34:20,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:34:20,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:20,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:20,455 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:34:20,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:20,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339226989] [2025-01-10 06:34:20,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339226989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:20,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:20,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:20,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216337458] [2025-01-10 06:34:20,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:20,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:34:20,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:20,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:34:20,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:34:20,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-10 06:34:20,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:34:20,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:20,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-10 06:34:20,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:20,637 INFO L124 PetriNetUnfolderBase]: 640/1334 cut-off events. [2025-01-10 06:34:20,637 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-01-10 06:34:20,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2417 conditions, 1334 events. 640/1334 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7540 event pairs, 570 based on Foata normal form. 70/1293 useless extension candidates. Maximal degree in co-relation 1594. Up to 1043 conditions per place. [2025-01-10 06:34:20,653 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 31 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2025-01-10 06:34:20,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 186 flow [2025-01-10 06:34:20,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:34:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:34:20,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-01-10 06:34:20,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-01-10 06:34:20,654 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 120 flow. Second operand 4 states and 120 transitions. [2025-01-10 06:34:20,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 186 flow [2025-01-10 06:34:20,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:34:20,656 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 138 flow [2025-01-10 06:34:20,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-01-10 06:34:20,656 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2025-01-10 06:34:20,656 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 138 flow [2025-01-10 06:34:20,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:34:20,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:20,657 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:34:20,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:34:20,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:20,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:20,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1637430283, now seen corresponding path program 1 times [2025-01-10 06:34:20,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:20,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850274893] [2025-01-10 06:34:20,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:20,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:20,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:20,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:20,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:20,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:20,715 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:34:20,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:20,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850274893] [2025-01-10 06:34:20,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850274893] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:20,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395287841] [2025-01-10 06:34:20,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:20,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:20,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:20,718 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:34:20,719 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:34:20,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:20,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:20,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:20,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:20,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:34:20,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:20,782 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:34:20,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:34:20,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395287841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:20,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:34:20,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:34:20,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389644359] [2025-01-10 06:34:20,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:20,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:34:20,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:20,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:34:20,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:34:20,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-10 06:34:20,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:20,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:20,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-10 06:34:20,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:20,944 INFO L124 PetriNetUnfolderBase]: 640/1333 cut-off events. [2025-01-10 06:34:20,945 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-10 06:34:20,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2427 conditions, 1333 events. 640/1333 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7567 event pairs, 570 based on Foata normal form. 1/1223 useless extension candidates. Maximal degree in co-relation 2408. Up to 1038 conditions per place. [2025-01-10 06:34:20,949 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 27 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2025-01-10 06:34:20,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 200 flow [2025-01-10 06:34:20,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:34:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:34:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2025-01-10 06:34:20,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-01-10 06:34:20,951 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 138 flow. Second operand 6 states and 154 transitions. [2025-01-10 06:34:20,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 200 flow [2025-01-10 06:34:20,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 53 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:34:20,952 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 144 flow [2025-01-10 06:34:20,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2025-01-10 06:34:20,952 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2025-01-10 06:34:20,952 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 144 flow [2025-01-10 06:34:20,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:20,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:20,953 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:34:20,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:34:21,153 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,SelfDestructingSolverStorable8 [2025-01-10 06:34:21,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:21,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:21,154 INFO L85 PathProgramCache]: Analyzing trace with hash -779268454, now seen corresponding path program 1 times [2025-01-10 06:34:21,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:21,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580407585] [2025-01-10 06:34:21,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:21,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:21,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:34:21,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:34:21,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:21,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:21,173 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:34:21,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:21,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580407585] [2025-01-10 06:34:21,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580407585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:21,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:21,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:21,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723830664] [2025-01-10 06:34:21,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:21,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:21,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:21,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:21,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:21,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-10 06:34:21,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:34:21,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:21,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-10 06:34:21,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:21,294 INFO L124 PetriNetUnfolderBase]: 640/1332 cut-off events. [2025-01-10 06:34:21,294 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-01-10 06:34:21,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2429 conditions, 1332 events. 640/1332 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7553 event pairs, 570 based on Foata normal form. 1/1223 useless extension candidates. Maximal degree in co-relation 2404. Up to 1041 conditions per place. [2025-01-10 06:34:21,300 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 28 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2025-01-10 06:34:21,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 52 transitions, 204 flow [2025-01-10 06:34:21,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-01-10 06:34:21,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2025-01-10 06:34:21,302 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 144 flow. Second operand 3 states and 91 transitions. [2025-01-10 06:34:21,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 52 transitions, 204 flow [2025-01-10 06:34:21,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 182 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 06:34:21,303 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 126 flow [2025-01-10 06:34:21,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2025-01-10 06:34:21,303 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2025-01-10 06:34:21,303 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 126 flow [2025-01-10 06:34:21,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:34:21,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:21,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:21,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:34:21,304 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:21,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:21,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1552058350, now seen corresponding path program 1 times [2025-01-10 06:34:21,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:21,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676879512] [2025-01-10 06:34:21,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:21,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:21,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:21,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:21,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:21,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:21,340 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:34:21,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:21,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676879512] [2025-01-10 06:34:21,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676879512] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:21,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376303194] [2025-01-10 06:34:21,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:21,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:21,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:21,342 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:34:21,344 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:34:21,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:21,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:21,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:21,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:21,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:34:21,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:21,409 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:34:21,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:34:21,428 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:34:21,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376303194] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:34:21,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:34:21,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 06:34:21,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724340588] [2025-01-10 06:34:21,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:34:21,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:34:21,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:21,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:34:21,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:34:21,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-10 06:34:21,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 126 flow. Second operand has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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:34:21,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:21,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-10 06:34:21,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:21,622 INFO L124 PetriNetUnfolderBase]: 640/1336 cut-off events. [2025-01-10 06:34:21,622 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-01-10 06:34:21,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2432 conditions, 1336 events. 640/1336 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7569 event pairs, 570 based on Foata normal form. 2/1229 useless extension candidates. Maximal degree in co-relation 2397. Up to 1039 conditions per place. [2025-01-10 06:34:21,629 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 28 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2025-01-10 06:34:21,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 211 flow [2025-01-10 06:34:21,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:34:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:34:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2025-01-10 06:34:21,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4597402597402597 [2025-01-10 06:34:21,634 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 126 flow. Second operand 7 states and 177 transitions. [2025-01-10 06:34:21,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 211 flow [2025-01-10 06:34:21,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:21,635 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 152 flow [2025-01-10 06:34:21,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2025-01-10 06:34:21,636 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2025-01-10 06:34:21,636 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 152 flow [2025-01-10 06:34:21,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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:34:21,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:21,636 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:21,650 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:34:21,837 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:34:21,840 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:21,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:21,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1049199954, now seen corresponding path program 2 times [2025-01-10 06:34:21,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:21,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927950520] [2025-01-10 06:34:21,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:34:21,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:21,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 06:34:21,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-01-10 06:34:21,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:34:21,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:21,885 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:34:21,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:21,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927950520] [2025-01-10 06:34:21,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927950520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:21,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:21,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:21,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610060587] [2025-01-10 06:34:21,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:21,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:21,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:21,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:21,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:21,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-10 06:34:21,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:34:21,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:21,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-10 06:34:21,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:22,040 INFO L124 PetriNetUnfolderBase]: 698/1432 cut-off events. [2025-01-10 06:34:22,040 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-01-10 06:34:22,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2632 conditions, 1432 events. 698/1432 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8005 event pairs, 291 based on Foata normal form. 36/1390 useless extension candidates. Maximal degree in co-relation 2592. Up to 976 conditions per place. [2025-01-10 06:34:22,046 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 48 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-01-10 06:34:22,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 68 transitions, 283 flow [2025-01-10 06:34:22,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-01-10 06:34:22,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2025-01-10 06:34:22,047 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 152 flow. Second operand 3 states and 106 transitions. [2025-01-10 06:34:22,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 68 transitions, 283 flow [2025-01-10 06:34:22,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 279 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:22,048 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 150 flow [2025-01-10 06:34:22,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2025-01-10 06:34:22,049 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2025-01-10 06:34:22,049 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 150 flow [2025-01-10 06:34:22,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:34:22,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:22,049 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:22,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:34:22,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:22,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:22,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1834539414, now seen corresponding path program 1 times [2025-01-10 06:34:22,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:22,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685788688] [2025-01-10 06:34:22,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:22,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:22,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:34:22,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:34:22,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:22,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:22,098 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:34:22,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:22,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685788688] [2025-01-10 06:34:22,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685788688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:22,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:22,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:22,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900873588] [2025-01-10 06:34:22,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:22,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:22,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:22,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:22,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:22,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-10 06:34:22,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:34:22,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:22,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-10 06:34:22,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:22,205 INFO L124 PetriNetUnfolderBase]: 640/1326 cut-off events. [2025-01-10 06:34:22,205 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-01-10 06:34:22,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 1326 events. 640/1326 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7254 event pairs, 264 based on Foata normal form. 36/1290 useless extension candidates. Maximal degree in co-relation 2461. Up to 882 conditions per place. [2025-01-10 06:34:22,210 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 47 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2025-01-10 06:34:22,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 67 transitions, 279 flow [2025-01-10 06:34:22,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-01-10 06:34:22,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-01-10 06:34:22,211 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 150 flow. Second operand 3 states and 105 transitions. [2025-01-10 06:34:22,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 67 transitions, 279 flow [2025-01-10 06:34:22,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 67 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:22,212 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 148 flow [2025-01-10 06:34:22,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2025-01-10 06:34:22,212 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2025-01-10 06:34:22,213 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 148 flow [2025-01-10 06:34:22,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:34:22,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:22,213 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:22,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:34:22,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:22,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:22,213 INFO L85 PathProgramCache]: Analyzing trace with hash -2084029517, now seen corresponding path program 1 times [2025-01-10 06:34:22,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:22,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315274556] [2025-01-10 06:34:22,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:22,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:22,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:34:22,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:34:22,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:22,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:22,251 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:34:22,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:22,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315274556] [2025-01-10 06:34:22,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315274556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:22,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:22,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:22,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585894344] [2025-01-10 06:34:22,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:22,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:22,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:22,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:22,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:22,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-10 06:34:22,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:34:22,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:22,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-10 06:34:22,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:22,364 INFO L124 PetriNetUnfolderBase]: 695/1410 cut-off events. [2025-01-10 06:34:22,364 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-01-10 06:34:22,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 1410 events. 695/1410 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7856 event pairs, 102 based on Foata normal form. 33/1396 useless extension candidates. Maximal degree in co-relation 2639. Up to 913 conditions per place. [2025-01-10 06:34:22,373 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 47 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-01-10 06:34:22,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 274 flow [2025-01-10 06:34:22,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:22,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-01-10 06:34:22,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-01-10 06:34:22,374 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 148 flow. Second operand 3 states and 105 transitions. [2025-01-10 06:34:22,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 274 flow [2025-01-10 06:34:22,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 65 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:22,376 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 146 flow [2025-01-10 06:34:22,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2025-01-10 06:34:22,376 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 5 predicate places. [2025-01-10 06:34:22,376 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 146 flow [2025-01-10 06:34:22,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:34:22,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:22,376 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 06:34:22,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:34:22,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:22,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:22,377 INFO L85 PathProgramCache]: Analyzing trace with hash -180413778, now seen corresponding path program 1 times [2025-01-10 06:34:22,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:22,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914309228] [2025-01-10 06:34:22,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:22,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:22,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:34:22,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:34:22,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:22,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:22,478 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:34:22,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:22,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914309228] [2025-01-10 06:34:22,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914309228] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:22,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671838730] [2025-01-10 06:34:22,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:22,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:22,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:22,480 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:34:22,485 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:34:22,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:34:22,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:34:22,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:22,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:22,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:34:22,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:22,589 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:34:22,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:34:22,654 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:34:22,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671838730] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:34:22,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:34:22,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-01-10 06:34:22,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990477056] [2025-01-10 06:34:22,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:34:22,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 06:34:22,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:22,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 06:34:22,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:34:22,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-10 06:34:22,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 146 flow. Second operand has 15 states, 15 states have (on average 21.4) internal successors, (321), 15 states have internal predecessors, (321), 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:34:22,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:22,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-10 06:34:22,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:22,874 INFO L124 PetriNetUnfolderBase]: 640/1331 cut-off events. [2025-01-10 06:34:22,874 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-01-10 06:34:22,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2517 conditions, 1331 events. 640/1331 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7416 event pairs, 570 based on Foata normal form. 3/1239 useless extension candidates. Maximal degree in co-relation 2451. Up to 1039 conditions per place. [2025-01-10 06:34:22,880 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 28 selfloop transitions, 13 changer transitions 0/58 dead transitions. [2025-01-10 06:34:22,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 58 transitions, 264 flow [2025-01-10 06:34:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:34:22,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:34:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 304 transitions. [2025-01-10 06:34:22,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4251748251748252 [2025-01-10 06:34:22,882 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 146 flow. Second operand 13 states and 304 transitions. [2025-01-10 06:34:22,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 58 transitions, 264 flow [2025-01-10 06:34:22,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 58 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:22,883 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 219 flow [2025-01-10 06:34:22,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=219, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2025-01-10 06:34:22,883 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 18 predicate places. [2025-01-10 06:34:22,883 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 219 flow [2025-01-10 06:34:22,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 21.4) internal successors, (321), 15 states have internal predecessors, (321), 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:34:22,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:22,884 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 06:34:22,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 06:34:23,084 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,SelfDestructingSolverStorable14 [2025-01-10 06:34:23,084 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:23,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:23,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1837977476, now seen corresponding path program 2 times [2025-01-10 06:34:23,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:23,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485108128] [2025-01-10 06:34:23,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:34:23,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:23,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 06:34:23,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:34:23,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:34:23,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:23,100 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:34:23,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:34:23,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:34:23,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:23,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:23,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:34:23,111 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:34:23,111 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-01-10 06:34:23,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-01-10 06:34:23,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-01-10 06:34:23,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-01-10 06:34:23,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-01-10 06:34:23,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-01-10 06:34:23,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2025-01-10 06:34:23,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-01-10 06:34:23,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-01-10 06:34:23,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-01-10 06:34:23,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-01-10 06:34:23,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-01-10 06:34:23,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-01-10 06:34:23,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-01-10 06:34:23,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-01-10 06:34:23,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:34:23,112 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:34:23,112 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:34:23,112 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:34:23,133 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:34:23,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 77 transitions, 172 flow [2025-01-10 06:34:23,138 INFO L124 PetriNetUnfolderBase]: 7/85 cut-off events. [2025-01-10 06:34:23,138 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 06:34:23,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 85 events. 7/85 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 208 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 66. Up to 4 conditions per place. [2025-01-10 06:34:23,139 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 77 transitions, 172 flow [2025-01-10 06:34:23,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 77 transitions, 172 flow [2025-01-10 06:34:23,140 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:34:23,140 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;@164c7151, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:34:23,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-01-10 06:34:23,141 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:34:23,141 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:34:23,141 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:23,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:23,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:34:23,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:23,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:23,141 INFO L85 PathProgramCache]: Analyzing trace with hash 419754, now seen corresponding path program 1 times [2025-01-10 06:34:23,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:23,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899050337] [2025-01-10 06:34:23,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:23,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:23,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:34:23,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:34:23,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:23,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:23,160 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:34:23,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:23,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899050337] [2025-01-10 06:34:23,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899050337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:23,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:23,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:23,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916887245] [2025-01-10 06:34:23,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:23,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:34:23,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:23,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:34:23,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:34:23,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-01-10 06:34:23,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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:34:23,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:23,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-01-10 06:34:23,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:24,299 INFO L124 PetriNetUnfolderBase]: 11409/19203 cut-off events. [2025-01-10 06:34:24,299 INFO L125 PetriNetUnfolderBase]: For 805/805 co-relation queries the response was YES. [2025-01-10 06:34:24,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35533 conditions, 19203 events. 11409/19203 cut-off events. For 805/805 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146540 event pairs, 10250 based on Foata normal form. 1159/19045 useless extension candidates. Maximal degree in co-relation 15025. Up to 15805 conditions per place. [2025-01-10 06:34:24,383 INFO L140 encePairwiseOnDemand]: 67/77 looper letters, 43 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-01-10 06:34:24,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 75 transitions, 260 flow [2025-01-10 06:34:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:34:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:34:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2025-01-10 06:34:24,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5487012987012987 [2025-01-10 06:34:24,384 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 172 flow. Second operand 4 states and 169 transitions. [2025-01-10 06:34:24,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 75 transitions, 260 flow [2025-01-10 06:34:24,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 258 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 06:34:24,385 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 186 flow [2025-01-10 06:34:24,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2025-01-10 06:34:24,386 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-01-10 06:34:24,386 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 186 flow [2025-01-10 06:34:24,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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:34:24,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:24,386 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:34:24,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:34:24,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:24,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:24,387 INFO L85 PathProgramCache]: Analyzing trace with hash -379610901, now seen corresponding path program 1 times [2025-01-10 06:34:24,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:24,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718452019] [2025-01-10 06:34:24,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:24,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:24,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:24,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:24,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:24,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:24,419 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:34:24,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:24,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718452019] [2025-01-10 06:34:24,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718452019] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:24,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064121890] [2025-01-10 06:34:24,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:24,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:24,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:24,421 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:34:24,423 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:34:24,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:24,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:24,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:24,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:24,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:34:24,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:24,490 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:34:24,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:34:24,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064121890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:24,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:34:24,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:34:24,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365039475] [2025-01-10 06:34:24,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:24,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:34:24,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:24,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:34:24,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:34:24,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-01-10 06:34:24,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 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:34:24,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:24,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-01-10 06:34:24,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:25,878 INFO L124 PetriNetUnfolderBase]: 11409/19202 cut-off events. [2025-01-10 06:34:25,878 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2025-01-10 06:34:25,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35422 conditions, 19202 events. 11409/19202 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146597 event pairs, 10250 based on Foata normal form. 1/17886 useless extension candidates. Maximal degree in co-relation 35402. Up to 15800 conditions per place. [2025-01-10 06:34:25,952 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 39 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2025-01-10 06:34:25,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 74 transitions, 272 flow [2025-01-10 06:34:25,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:34:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:34:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 220 transitions. [2025-01-10 06:34:25,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-01-10 06:34:25,956 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 186 flow. Second operand 6 states and 220 transitions. [2025-01-10 06:34:25,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 74 transitions, 272 flow [2025-01-10 06:34:25,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 74 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:34:25,958 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 192 flow [2025-01-10 06:34:25,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2025-01-10 06:34:25,958 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-01-10 06:34:25,958 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 192 flow [2025-01-10 06:34:25,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 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:34:25,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:25,959 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:34:25,968 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:34:26,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:26,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:26,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1116964359, now seen corresponding path program 1 times [2025-01-10 06:34:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:26,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826803864] [2025-01-10 06:34:26,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:26,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:26,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:34:26,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:34:26,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:26,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:26,184 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:34:26,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:26,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826803864] [2025-01-10 06:34:26,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826803864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:26,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:26,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:26,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044755867] [2025-01-10 06:34:26,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:26,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:26,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:26,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:26,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:26,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-01-10 06:34:26,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 74 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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:34:26,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:26,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-01-10 06:34:26,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:27,081 INFO L124 PetriNetUnfolderBase]: 11409/19201 cut-off events. [2025-01-10 06:34:27,081 INFO L125 PetriNetUnfolderBase]: For 453/453 co-relation queries the response was YES. [2025-01-10 06:34:27,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35424 conditions, 19201 events. 11409/19201 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146489 event pairs, 10250 based on Foata normal form. 1/17886 useless extension candidates. Maximal degree in co-relation 35398. Up to 15803 conditions per place. [2025-01-10 06:34:27,176 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 40 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2025-01-10 06:34:27,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 73 transitions, 276 flow [2025-01-10 06:34:27,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-01-10 06:34:27,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5627705627705628 [2025-01-10 06:34:27,178 INFO L175 Difference]: Start difference. First operand has 84 places, 74 transitions, 192 flow. Second operand 3 states and 130 transitions. [2025-01-10 06:34:27,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 73 transitions, 276 flow [2025-01-10 06:34:27,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 73 transitions, 254 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 06:34:27,179 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 174 flow [2025-01-10 06:34:27,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2025-01-10 06:34:27,180 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 2 predicate places. [2025-01-10 06:34:27,180 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 174 flow [2025-01-10 06:34:27,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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:34:27,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:27,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:27,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:34:27,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:27,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:27,181 INFO L85 PathProgramCache]: Analyzing trace with hash -338435916, now seen corresponding path program 1 times [2025-01-10 06:34:27,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:27,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698540585] [2025-01-10 06:34:27,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:27,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:27,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:27,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:27,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:27,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:27,228 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:34:27,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:27,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698540585] [2025-01-10 06:34:27,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698540585] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:27,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769550457] [2025-01-10 06:34:27,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:27,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:27,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:27,230 INFO L229 MonitoredProcess]: Starting monitored process 9 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:34:27,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:34:27,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:27,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:27,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:27,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:27,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:34:27,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:27,310 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:34:27,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:34:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:27,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769550457] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:34:27,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:34:27,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 06:34:27,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674015114] [2025-01-10 06:34:27,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:34:27,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:34:27,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:27,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:34:27,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:34:27,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-01-10 06:34:27,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 174 flow. Second operand has 10 states, 10 states have (on average 30.4) internal successors, (304), 10 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:27,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:27,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-01-10 06:34:27,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:28,469 INFO L124 PetriNetUnfolderBase]: 11409/19205 cut-off events. [2025-01-10 06:34:28,469 INFO L125 PetriNetUnfolderBase]: For 455/455 co-relation queries the response was YES. [2025-01-10 06:34:28,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35427 conditions, 19205 events. 11409/19205 cut-off events. For 455/455 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146505 event pairs, 10250 based on Foata normal form. 2/17892 useless extension candidates. Maximal degree in co-relation 35391. Up to 15801 conditions per place. [2025-01-10 06:34:28,597 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 40 selfloop transitions, 7 changer transitions 0/76 dead transitions. [2025-01-10 06:34:28,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 76 transitions, 283 flow [2025-01-10 06:34:28,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:34:28,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:34:28,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 252 transitions. [2025-01-10 06:34:28,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2025-01-10 06:34:28,598 INFO L175 Difference]: Start difference. First operand has 79 places, 73 transitions, 174 flow. Second operand 7 states and 252 transitions. [2025-01-10 06:34:28,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 76 transitions, 283 flow [2025-01-10 06:34:28,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 76 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:28,600 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 200 flow [2025-01-10 06:34:28,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=200, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2025-01-10 06:34:28,601 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 8 predicate places. [2025-01-10 06:34:28,601 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 200 flow [2025-01-10 06:34:28,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.4) internal successors, (304), 10 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:28,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:28,601 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:28,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 06:34:28,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:28,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:28,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:28,805 INFO L85 PathProgramCache]: Analyzing trace with hash -833813228, now seen corresponding path program 2 times [2025-01-10 06:34:28,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:28,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086179396] [2025-01-10 06:34:28,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:34:28,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:28,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 06:34:28,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-01-10 06:34:28,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:34:28,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:28,842 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:34:28,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:28,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086179396] [2025-01-10 06:34:28,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086179396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:28,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:28,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:28,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402438666] [2025-01-10 06:34:28,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:28,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:28,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:28,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:28,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:28,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-01-10 06:34:28,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:34:28,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:28,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-01-10 06:34:28,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:29,781 INFO L124 PetriNetUnfolderBase]: 12446/20635 cut-off events. [2025-01-10 06:34:29,782 INFO L125 PetriNetUnfolderBase]: For 465/465 co-relation queries the response was YES. [2025-01-10 06:34:29,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38336 conditions, 20635 events. 12446/20635 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 158591 event pairs, 1538 based on Foata normal form. 399/20377 useless extension candidates. Maximal degree in co-relation 38295. Up to 14759 conditions per place. [2025-01-10 06:34:29,895 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 72 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-01-10 06:34:29,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 101 transitions, 408 flow [2025-01-10 06:34:29,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:29,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2025-01-10 06:34:29,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6796536796536796 [2025-01-10 06:34:29,896 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 200 flow. Second operand 3 states and 157 transitions. [2025-01-10 06:34:29,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 101 transitions, 408 flow [2025-01-10 06:34:29,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 101 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:29,898 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 198 flow [2025-01-10 06:34:29,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=84, PETRI_TRANSITIONS=75} [2025-01-10 06:34:29,898 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-01-10 06:34:29,899 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 198 flow [2025-01-10 06:34:29,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:34:29,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:29,899 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:29,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:34:29,899 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:29,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:29,899 INFO L85 PathProgramCache]: Analyzing trace with hash -78405835, now seen corresponding path program 1 times [2025-01-10 06:34:29,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:29,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999332957] [2025-01-10 06:34:29,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:29,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:29,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:34:29,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:34:29,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:29,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:29,934 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:34:29,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:29,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999332957] [2025-01-10 06:34:29,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999332957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:29,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:29,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:29,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069311310] [2025-01-10 06:34:29,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:29,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:29,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:29,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:29,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:29,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-01-10 06:34:29,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 75 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:34:29,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:29,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-01-10 06:34:29,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:30,958 INFO L124 PetriNetUnfolderBase]: 11409/19199 cut-off events. [2025-01-10 06:34:30,959 INFO L125 PetriNetUnfolderBase]: For 1223/1223 co-relation queries the response was YES. [2025-01-10 06:34:30,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36225 conditions, 19199 events. 11409/19199 cut-off events. For 1223/1223 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 148129 event pairs, 1538 based on Foata normal form. 399/18956 useless extension candidates. Maximal degree in co-relation 36185. Up to 13323 conditions per place. [2025-01-10 06:34:31,044 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 71 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2025-01-10 06:34:31,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 100 transitions, 404 flow [2025-01-10 06:34:31,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:31,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-01-10 06:34:31,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6753246753246753 [2025-01-10 06:34:31,046 INFO L175 Difference]: Start difference. First operand has 84 places, 75 transitions, 198 flow. Second operand 3 states and 156 transitions. [2025-01-10 06:34:31,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 100 transitions, 404 flow [2025-01-10 06:34:31,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 100 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:31,049 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 196 flow [2025-01-10 06:34:31,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2025-01-10 06:34:31,049 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 6 predicate places. [2025-01-10 06:34:31,049 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 196 flow [2025-01-10 06:34:31,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:34:31,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:31,054 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:31,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:34:31,054 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:31,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:31,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1933183859, now seen corresponding path program 1 times [2025-01-10 06:34:31,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:31,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146393465] [2025-01-10 06:34:31,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:31,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:31,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:34:31,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:34:31,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:31,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:31,121 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:34:31,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:31,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146393465] [2025-01-10 06:34:31,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146393465] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:31,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314356283] [2025-01-10 06:34:31,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:31,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:31,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:31,123 INFO L229 MonitoredProcess]: Starting monitored process 10 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:34:31,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:34:31,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:34:31,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:34:31,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:31,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:31,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:34:31,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:31,209 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:34:31,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:34:31,257 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:34:31,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314356283] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:34:31,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:34:31,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-01-10 06:34:31,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56400421] [2025-01-10 06:34:31,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:34:31,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 06:34:31,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:31,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 06:34:31,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:34:31,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-01-10 06:34:31,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 196 flow. Second operand has 15 states, 15 states have (on average 30.466666666666665) internal successors, (457), 15 states have internal predecessors, (457), 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:34:31,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:31,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-01-10 06:34:31,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:32,138 INFO L124 PetriNetUnfolderBase]: 11409/19208 cut-off events. [2025-01-10 06:34:32,138 INFO L125 PetriNetUnfolderBase]: For 1264/1264 co-relation queries the response was YES. [2025-01-10 06:34:32,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36252 conditions, 19208 events. 11409/19208 cut-off events. For 1264/1264 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146553 event pairs, 10250 based on Foata normal form. 3/17902 useless extension candidates. Maximal degree in co-relation 36185. Up to 15801 conditions per place. [2025-01-10 06:34:32,245 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 40 selfloop transitions, 13 changer transitions 0/80 dead transitions. [2025-01-10 06:34:32,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 80 transitions, 338 flow [2025-01-10 06:34:32,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:34:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:34:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 433 transitions. [2025-01-10 06:34:32,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4325674325674326 [2025-01-10 06:34:32,248 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 196 flow. Second operand 13 states and 433 transitions. [2025-01-10 06:34:32,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 80 transitions, 338 flow [2025-01-10 06:34:32,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 80 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:32,250 INFO L231 Difference]: Finished difference. Result has 96 places, 80 transitions, 269 flow [2025-01-10 06:34:32,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=269, PETRI_PLACES=96, PETRI_TRANSITIONS=80} [2025-01-10 06:34:32,251 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 19 predicate places. [2025-01-10 06:34:32,251 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 80 transitions, 269 flow [2025-01-10 06:34:32,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 30.466666666666665) internal successors, (457), 15 states have internal predecessors, (457), 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:34:32,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:32,251 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:32,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 06:34:32,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:32,452 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:32,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:32,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1857575822, now seen corresponding path program 2 times [2025-01-10 06:34:32,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:32,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311102013] [2025-01-10 06:34:32,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:34:32,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:32,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-10 06:34:32,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 27 statements. [2025-01-10 06:34:32,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:34:32,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:32,480 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-10 06:34:32,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:32,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311102013] [2025-01-10 06:34:32,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311102013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:32,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:32,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:32,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607717686] [2025-01-10 06:34:32,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:32,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:32,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:32,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:32,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:32,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-01-10 06:34:32,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 80 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:34:32,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:32,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-01-10 06:34:32,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:33,381 INFO L124 PetriNetUnfolderBase]: 12443/20454 cut-off events. [2025-01-10 06:34:33,381 INFO L125 PetriNetUnfolderBase]: For 504/504 co-relation queries the response was YES. [2025-01-10 06:34:33,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38186 conditions, 20454 events. 12443/20454 cut-off events. For 504/504 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 151533 event pairs, 3941 based on Foata normal form. 396/19986 useless extension candidates. Maximal degree in co-relation 38099. Up to 14696 conditions per place. [2025-01-10 06:34:33,511 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 77 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2025-01-10 06:34:33,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 104 transitions, 480 flow [2025-01-10 06:34:33,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:33,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-01-10 06:34:33,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6753246753246753 [2025-01-10 06:34:33,513 INFO L175 Difference]: Start difference. First operand has 96 places, 80 transitions, 269 flow. Second operand 3 states and 156 transitions. [2025-01-10 06:34:33,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 104 transitions, 480 flow [2025-01-10 06:34:33,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 104 transitions, 470 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 06:34:33,514 INFO L231 Difference]: Finished difference. Result has 93 places, 79 transitions, 261 flow [2025-01-10 06:34:33,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=93, PETRI_TRANSITIONS=79} [2025-01-10 06:34:33,515 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 16 predicate places. [2025-01-10 06:34:33,515 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 79 transitions, 261 flow [2025-01-10 06:34:33,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:34:33,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:33,515 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:33,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 06:34:33,515 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:33,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:33,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1750275156, now seen corresponding path program 1 times [2025-01-10 06:34:33,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:33,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293655144] [2025-01-10 06:34:33,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:33,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:33,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:34:33,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:34:33,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:33,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-10 06:34:33,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:33,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293655144] [2025-01-10 06:34:33,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293655144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:33,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:33,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:33,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315067438] [2025-01-10 06:34:33,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:33,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:33,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:33,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:33,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:33,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-01-10 06:34:33,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 79 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:34:33,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:33,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-01-10 06:34:33,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:34,445 INFO L124 PetriNetUnfolderBase]: 11409/18892 cut-off events. [2025-01-10 06:34:34,446 INFO L125 PetriNetUnfolderBase]: For 1252/1252 co-relation queries the response was YES. [2025-01-10 06:34:34,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35949 conditions, 18892 events. 11409/18892 cut-off events. For 1252/1252 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 138804 event pairs, 3644 based on Foata normal form. 396/18475 useless extension candidates. Maximal degree in co-relation 35866. Up to 13266 conditions per place. [2025-01-10 06:34:34,522 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 76 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2025-01-10 06:34:34,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 103 transitions, 470 flow [2025-01-10 06:34:34,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-01-10 06:34:34,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.670995670995671 [2025-01-10 06:34:34,523 INFO L175 Difference]: Start difference. First operand has 93 places, 79 transitions, 261 flow. Second operand 3 states and 155 transitions. [2025-01-10 06:34:34,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 103 transitions, 470 flow [2025-01-10 06:34:34,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 103 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:34,525 INFO L231 Difference]: Finished difference. Result has 92 places, 78 transitions, 259 flow [2025-01-10 06:34:34,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=92, PETRI_TRANSITIONS=78} [2025-01-10 06:34:34,525 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 15 predicate places. [2025-01-10 06:34:34,525 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 78 transitions, 259 flow [2025-01-10 06:34:34,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:34:34,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:34,526 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:34,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:34:34,526 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:34,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:34,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1564494966, now seen corresponding path program 1 times [2025-01-10 06:34:34,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:34,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370677687] [2025-01-10 06:34:34,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:34,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:34,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:34:34,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:34:34,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:34,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-10 06:34:34,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:34,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370677687] [2025-01-10 06:34:34,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370677687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:34,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:34,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:34,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750109875] [2025-01-10 06:34:34,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:34,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:34,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:34,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:34,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:34,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-01-10 06:34:34,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 78 transitions, 259 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:34:34,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:34,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-01-10 06:34:34,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:35,632 INFO L124 PetriNetUnfolderBase]: 12377/20389 cut-off events. [2025-01-10 06:34:35,633 INFO L125 PetriNetUnfolderBase]: For 1348/1348 co-relation queries the response was YES. [2025-01-10 06:34:35,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38843 conditions, 20389 events. 12377/20389 cut-off events. For 1348/1348 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 152922 event pairs, 2132 based on Foata normal form. 363/20146 useless extension candidates. Maximal degree in co-relation 38760. Up to 13673 conditions per place. [2025-01-10 06:34:35,720 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 76 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-01-10 06:34:35,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 101 transitions, 465 flow [2025-01-10 06:34:35,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-01-10 06:34:35,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.670995670995671 [2025-01-10 06:34:35,722 INFO L175 Difference]: Start difference. First operand has 92 places, 78 transitions, 259 flow. Second operand 3 states and 155 transitions. [2025-01-10 06:34:35,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 101 transitions, 465 flow [2025-01-10 06:34:35,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 101 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:35,725 INFO L231 Difference]: Finished difference. Result has 91 places, 77 transitions, 257 flow [2025-01-10 06:34:35,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=257, PETRI_PLACES=91, PETRI_TRANSITIONS=77} [2025-01-10 06:34:35,725 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 14 predicate places. [2025-01-10 06:34:35,725 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 77 transitions, 257 flow [2025-01-10 06:34:35,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:34:35,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:35,726 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:35,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 06:34:35,726 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:35,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:35,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1254695597, now seen corresponding path program 1 times [2025-01-10 06:34:35,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:35,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270066761] [2025-01-10 06:34:35,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:35,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:35,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 06:34:35,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 06:34:35,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:35,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:35,740 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:34:35,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 06:34:35,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 06:34:35,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:35,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:35,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:34:35,751 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:34:35,751 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-01-10 06:34:35,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-01-10 06:34:35,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-01-10 06:34:35,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-01-10 06:34:35,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-01-10 06:34:35,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-01-10 06:34:35,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 19 remaining) [2025-01-10 06:34:35,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-01-10 06:34:35,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-01-10 06:34:35,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-01-10 06:34:35,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-01-10 06:34:35,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-01-10 06:34:35,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-01-10 06:34:35,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-01-10 06:34:35,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-01-10 06:34:35,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-01-10 06:34:35,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-01-10 06:34:35,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-01-10 06:34:35,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-01-10 06:34:35,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 06:34:35,753 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:35,753 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:34:35,753 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 06:34:35,777 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:34:35,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 99 transitions, 226 flow [2025-01-10 06:34:35,786 INFO L124 PetriNetUnfolderBase]: 9/110 cut-off events. [2025-01-10 06:34:35,786 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 06:34:35,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 110 events. 9/110 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 324 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 93. Up to 5 conditions per place. [2025-01-10 06:34:35,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 99 transitions, 226 flow [2025-01-10 06:34:35,787 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 99 transitions, 226 flow [2025-01-10 06:34:35,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:34:35,788 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;@164c7151, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:34:35,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-10 06:34:35,789 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:34:35,792 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:34:35,792 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:35,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:35,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:34:35,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:34:35,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:35,793 INFO L85 PathProgramCache]: Analyzing trace with hash 518061, now seen corresponding path program 1 times [2025-01-10 06:34:35,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:35,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692814438] [2025-01-10 06:34:35,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:35,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:35,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:34:35,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:34:35,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:35,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:35,815 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:34:35,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:35,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692814438] [2025-01-10 06:34:35,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692814438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:35,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:35,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:35,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600388560] [2025-01-10 06:34:35,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:35,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:34:35,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:35,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:34:35,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:34:35,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 99 [2025-01-10 06:34:35,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 99 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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:34:35,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:35,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 99 [2025-01-10 06:34:35,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:49,989 INFO L124 PetriNetUnfolderBase]: 173791/260033 cut-off events. [2025-01-10 06:34:49,989 INFO L125 PetriNetUnfolderBase]: For 14929/14929 co-relation queries the response was YES. [2025-01-10 06:34:50,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489324 conditions, 260033 events. 173791/260033 cut-off events. For 14929/14929 co-relation queries the response was YES. Maximal size of possible extension queue 8058. Compared 2291524 event pairs, 156660 based on Foata normal form. 17131/262288 useless extension candidates. Maximal degree in co-relation 75190. Up to 222110 conditions per place. [2025-01-10 06:34:51,874 INFO L140 encePairwiseOnDemand]: 88/99 looper letters, 55 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-01-10 06:34:51,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 96 transitions, 336 flow [2025-01-10 06:34:51,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:34:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:34:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 218 transitions. [2025-01-10 06:34:51,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5505050505050505 [2025-01-10 06:34:51,882 INFO L175 Difference]: Start difference. First operand has 99 places, 99 transitions, 226 flow. Second operand 4 states and 218 transitions. [2025-01-10 06:34:51,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 96 transitions, 336 flow [2025-01-10 06:34:51,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 96 transitions, 330 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-10 06:34:51,891 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 234 flow [2025-01-10 06:34:51,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=98, 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=234, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2025-01-10 06:34:51,892 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 4 predicate places. [2025-01-10 06:34:51,892 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 234 flow [2025-01-10 06:34:51,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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:34:51,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:51,892 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:34:51,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 06:34:51,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:34:51,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:51,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1745816053, now seen corresponding path program 1 times [2025-01-10 06:34:51,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:51,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34563605] [2025-01-10 06:34:51,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:51,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:51,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:51,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:51,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:51,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:51,933 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:34:51,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:51,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34563605] [2025-01-10 06:34:51,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34563605] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:51,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542211194] [2025-01-10 06:34:51,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:51,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:51,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:51,938 INFO L229 MonitoredProcess]: Starting monitored process 11 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:34:51,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 06:34:51,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:52,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:52,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:52,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:52,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:34:52,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:52,015 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:34:52,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:34:52,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542211194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:52,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:34:52,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:34:52,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086169592] [2025-01-10 06:34:52,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:52,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:34:52,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:52,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:34:52,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:34:52,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 99 [2025-01-10 06:34:52,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 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:34:52,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:52,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 99 [2025-01-10 06:34:52,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand