./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/weaver/popl20-three-array-min.wvr.c -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 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:54:51,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:54:51,691 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:54:51,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:54:51,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:54:51,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:54:51,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:54:51,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:54:51,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:54:51,708 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:54:51,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:54:51,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:54:51,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:54:51,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:54:51,709 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:54:51,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:54:51,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:54:51,709 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:54:51,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:54:51,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:54:51,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:54:51,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:54:51,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:54:51,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:54:51,710 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:54:51,710 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:54:51,710 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:54:51,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:54:51,710 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:54:51,710 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:54:51,710 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:54:51,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:54:51,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:54:51,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:54:51,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:54:51,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:54:51,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:54:51,711 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:54:51,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:54:51,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:54:51,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:54:51,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:54:51,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:54:51,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:54:51,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:54:51,712 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 -> 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 [2025-02-06 18:54:51,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:54:51,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:54:51,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:54:51,896 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:54:51,897 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:54:51,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-02-06 18:54:53,044 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ae6d77ef/a30d7f243cd8431d841eab2bd54cbaf3/FLAG291ccdf13 [2025-02-06 18:54:53,289 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:54:53,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-02-06 18:54:53,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ae6d77ef/a30d7f243cd8431d841eab2bd54cbaf3/FLAG291ccdf13 [2025-02-06 18:54:53,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ae6d77ef/a30d7f243cd8431d841eab2bd54cbaf3 [2025-02-06 18:54:53,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:54:53,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:54:53,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:54:53,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:54:53,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:54:53,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:54:53" (1/1) ... [2025-02-06 18:54:53,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c233ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:54:53, skipping insertion in model container [2025-02-06 18:54:53,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:54:53" (1/1) ... [2025-02-06 18:54:53,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:54:53,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:54:53,490 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:54:53,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:54:53,531 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:54:53,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:54:53 WrapperNode [2025-02-06 18:54:53,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:54:53,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:54:53,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:54:53,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:54:53,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:54:53" (1/1) ... [2025-02-06 18:54:53,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:54:53" (1/1) ... [2025-02-06 18:54:53,566 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 264 [2025-02-06 18:54:53,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:54:53,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:54:53,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:54:53,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:54:53,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:54:53" (1/1) ... [2025-02-06 18:54:53,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:54:53" (1/1) ... [2025-02-06 18:54:53,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:54:53" (1/1) ... [2025-02-06 18:54:53,591 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-02-06 18:54:53,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:54:53" (1/1) ... [2025-02-06 18:54:53,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:54:53" (1/1) ... [2025-02-06 18:54:53,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:54:53" (1/1) ... [2025-02-06 18:54:53,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:54:53" (1/1) ... [2025-02-06 18:54:53,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:54:53" (1/1) ... [2025-02-06 18:54:53,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:54:53" (1/1) ... [2025-02-06 18:54:53,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:54:53,607 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:54:53,607 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:54:53,607 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:54:53,607 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:54:53" (1/1) ... [2025-02-06 18:54:53,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:54:53,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:54:53,645 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-02-06 18:54:53,647 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-02-06 18:54:53,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:54:53,665 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 18:54:53,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 18:54:53,665 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 18:54:53,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 18:54:53,665 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 18:54:53,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 18:54:53,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:54:53,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:54:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:54:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:54:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 18:54:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 18:54:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:54:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:54:53,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:54:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:54:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:54:53,667 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:54:53,758 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:54:53,759 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:54:54,197 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:54:54,197 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:54:54,543 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:54:54,544 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:54:54,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:54:54 BoogieIcfgContainer [2025-02-06 18:54:54,545 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:54:54,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:54:54,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:54:54,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:54:54,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:54:53" (1/3) ... [2025-02-06 18:54:54,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462fa03c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:54:54, skipping insertion in model container [2025-02-06 18:54:54,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:54:53" (2/3) ... [2025-02-06 18:54:54,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462fa03c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:54:54, skipping insertion in model container [2025-02-06 18:54:54,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:54:54" (3/3) ... [2025-02-06 18:54:54,552 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2025-02-06 18:54:54,566 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:54:54,567 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-min.wvr.c that has 4 procedures, 95 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-02-06 18:54:54,568 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:54:54,652 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 18:54:54,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 105 transitions, 231 flow [2025-02-06 18:54:54,721 INFO L124 PetriNetUnfolderBase]: 11/102 cut-off events. [2025-02-06 18:54:54,725 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 18:54:54,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 11/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 266 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-02-06 18:54:54,730 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 105 transitions, 231 flow [2025-02-06 18:54:54,733 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 220 flow [2025-02-06 18:54:54,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:54:54,751 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;@75bfce47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:54:54,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2025-02-06 18:54:54,754 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:54:54,754 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-06 18:54:54,754 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:54:54,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:54:54,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 18:54:54,759 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:54:54,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:54:54,769 INFO L85 PathProgramCache]: Analyzing trace with hash 910156, now seen corresponding path program 1 times [2025-02-06 18:54:54,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:54:54,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300311635] [2025-02-06 18:54:54,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:54:54,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:54:54,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:54:54,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:54:54,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:54:54,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:54:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:54:54,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:54:54,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300311635] [2025-02-06 18:54:54,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300311635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:54:54,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:54:54,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:54:54,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175216996] [2025-02-06 18:54:54,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:54:54,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:54:54,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:54:54,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:54:54,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:54:55,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-02-06 18:54:55,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 101 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 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-02-06 18:54:55,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:54:55,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-02-06 18:54:55,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:54:55,410 INFO L124 PetriNetUnfolderBase]: 1374/2592 cut-off events. [2025-02-06 18:54:55,411 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2025-02-06 18:54:55,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4608 conditions, 2592 events. 1374/2592 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17041 event pairs, 1018 based on Foata normal form. 3/1922 useless extension candidates. Maximal degree in co-relation 4086. Up to 1857 conditions per place. [2025-02-06 18:54:55,430 INFO L140 encePairwiseOnDemand]: 87/105 looper letters, 53 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2025-02-06 18:54:55,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 108 transitions, 360 flow [2025-02-06 18:54:55,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:54:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:54:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 263 transitions. [2025-02-06 18:54:55,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6261904761904762 [2025-02-06 18:54:55,440 INFO L175 Difference]: Start difference. First operand has 100 places, 101 transitions, 220 flow. Second operand 4 states and 263 transitions. [2025-02-06 18:54:55,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 108 transitions, 360 flow [2025-02-06 18:54:55,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 108 transitions, 348 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 18:54:55,447 INFO L231 Difference]: Finished difference. Result has 98 places, 108 transitions, 292 flow [2025-02-06 18:54:55,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=292, PETRI_PLACES=98, PETRI_TRANSITIONS=108} [2025-02-06 18:54:55,451 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2025-02-06 18:54:55,451 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 108 transitions, 292 flow [2025-02-06 18:54:55,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 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-02-06 18:54:55,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:54:55,451 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-06 18:54:55,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:54:55,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:54:55,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:54:55,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1345439807, now seen corresponding path program 1 times [2025-02-06 18:54:55,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:54:55,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635499378] [2025-02-06 18:54:55,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:54:55,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:54:55,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:54:55,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:54:55,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:54:55,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:54:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:54:55,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:54:55,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635499378] [2025-02-06 18:54:55,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635499378] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:54:55,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131856601] [2025-02-06 18:54:55,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:54:55,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:54:55,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:54:55,538 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-02-06 18:54:55,540 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-02-06 18:54:55,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:54:55,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:54:55,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:54:55,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:54:55,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:54:55,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:54:55,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:54:55,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:54:55,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131856601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:54:55,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:54:55,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 18:54:55,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068857397] [2025-02-06 18:54:55,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:54:55,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:54:55,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:54:55,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:54:55,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:54:55,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-02-06 18:54:55,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 108 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 48.833333333333336) internal successors, (293), 6 states have internal predecessors, (293), 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-02-06 18:54:55,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:54:55,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-02-06 18:54:55,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:54:55,982 INFO L124 PetriNetUnfolderBase]: 1374/2589 cut-off events. [2025-02-06 18:54:55,982 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-02-06 18:54:55,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4532 conditions, 2589 events. 1374/2589 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17056 event pairs, 1018 based on Foata normal form. 3/1924 useless extension candidates. Maximal degree in co-relation 4459. Up to 1842 conditions per place. [2025-02-06 18:54:55,995 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 43 selfloop transitions, 17 changer transitions 0/105 dead transitions. [2025-02-06 18:54:55,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 105 transitions, 400 flow [2025-02-06 18:54:55,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:54:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:54:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 351 transitions. [2025-02-06 18:54:55,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2025-02-06 18:54:55,998 INFO L175 Difference]: Start difference. First operand has 98 places, 108 transitions, 292 flow. Second operand 6 states and 351 transitions. [2025-02-06 18:54:55,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 105 transitions, 400 flow [2025-02-06 18:54:55,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 105 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:54:56,000 INFO L231 Difference]: Finished difference. Result has 100 places, 105 transitions, 314 flow [2025-02-06 18:54:56,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=100, PETRI_TRANSITIONS=105} [2025-02-06 18:54:56,001 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 0 predicate places. [2025-02-06 18:54:56,001 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 105 transitions, 314 flow [2025-02-06 18:54:56,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.833333333333336) internal successors, (293), 6 states have internal predecessors, (293), 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-02-06 18:54:56,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:54:56,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:54:56,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 18:54:56,203 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-02-06 18:54:56,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:54:56,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:54:56,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1346612458, now seen corresponding path program 1 times [2025-02-06 18:54:56,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:54:56,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770385982] [2025-02-06 18:54:56,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:54:56,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:54:56,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:54:56,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:54:56,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:54:56,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:54:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:54:56,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:54:56,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770385982] [2025-02-06 18:54:56,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770385982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:54:56,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:54:56,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:54:56,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85045499] [2025-02-06 18:54:56,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:54:56,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:54:56,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:54:56,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:54:56,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:54:56,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-02-06 18:54:56,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 105 transitions, 314 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-02-06 18:54:56,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:54:56,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-02-06 18:54:56,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:54:56,637 INFO L124 PetriNetUnfolderBase]: 1375/2606 cut-off events. [2025-02-06 18:54:56,638 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-02-06 18:54:56,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4581 conditions, 2606 events. 1375/2606 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17081 event pairs, 1018 based on Foata normal form. 4/1941 useless extension candidates. Maximal degree in co-relation 4495. Up to 1857 conditions per place. [2025-02-06 18:54:56,653 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 64 selfloop transitions, 10 changer transitions 0/110 dead transitions. [2025-02-06 18:54:56,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 110 transitions, 472 flow [2025-02-06 18:54:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:54:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:54:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-02-06 18:54:56,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.569047619047619 [2025-02-06 18:54:56,655 INFO L175 Difference]: Start difference. First operand has 100 places, 105 transitions, 314 flow. Second operand 4 states and 239 transitions. [2025-02-06 18:54:56,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 110 transitions, 472 flow [2025-02-06 18:54:56,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 110 transitions, 434 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-02-06 18:54:56,658 INFO L231 Difference]: Finished difference. Result has 99 places, 108 transitions, 340 flow [2025-02-06 18:54:56,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=99, PETRI_TRANSITIONS=108} [2025-02-06 18:54:56,659 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -1 predicate places. [2025-02-06 18:54:56,659 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 108 transitions, 340 flow [2025-02-06 18:54:56,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-02-06 18:54:56,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:54:56,659 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-06 18:54:56,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:54:56,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:54:56,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:54:56,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1241038155, now seen corresponding path program 1 times [2025-02-06 18:54:56,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:54:56,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381639645] [2025-02-06 18:54:56,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:54:56,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:54:56,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:54:56,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:54:56,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:54:56,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:54:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:54:56,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:54:56,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381639645] [2025-02-06 18:54:56,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381639645] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:54:56,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727195072] [2025-02-06 18:54:56,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:54:56,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:54:56,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:54:56,752 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-02-06 18:54:56,758 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-02-06 18:54:56,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:54:56,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:54:56,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:54:56,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:54:56,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:54:56,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:54:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:54:56,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:54:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:54:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727195072] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:54:56,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:54:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-06 18:54:56,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66991308] [2025-02-06 18:54:56,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:54:56,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 18:54:56,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:54:56,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 18:54:56,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 18:54:56,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-02-06 18:54:56,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 108 transitions, 340 flow. Second operand has 12 states, 12 states have (on average 49.083333333333336) internal successors, (589), 12 states have internal predecessors, (589), 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-02-06 18:54:56,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:54:56,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-02-06 18:54:56,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:54:57,231 INFO L124 PetriNetUnfolderBase]: 1384/2642 cut-off events. [2025-02-06 18:54:57,232 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-02-06 18:54:57,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4689 conditions, 2642 events. 1384/2642 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17378 event pairs, 1018 based on Foata normal form. 9/1981 useless extension candidates. Maximal degree in co-relation 4506. Up to 1862 conditions per place. [2025-02-06 18:54:57,246 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 53 selfloop transitions, 37 changer transitions 0/135 dead transitions. [2025-02-06 18:54:57,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 135 transitions, 661 flow [2025-02-06 18:54:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:54:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:54:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 576 transitions. [2025-02-06 18:54:57,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5485714285714286 [2025-02-06 18:54:57,250 INFO L175 Difference]: Start difference. First operand has 99 places, 108 transitions, 340 flow. Second operand 10 states and 576 transitions. [2025-02-06 18:54:57,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 135 transitions, 661 flow [2025-02-06 18:54:57,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 135 transitions, 661 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:54:57,254 INFO L231 Difference]: Finished difference. Result has 111 places, 135 transitions, 605 flow [2025-02-06 18:54:57,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=605, PETRI_PLACES=111, PETRI_TRANSITIONS=135} [2025-02-06 18:54:57,255 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2025-02-06 18:54:57,255 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 135 transitions, 605 flow [2025-02-06 18:54:57,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 49.083333333333336) internal successors, (589), 12 states have internal predecessors, (589), 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-02-06 18:54:57,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:54:57,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:54:57,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 18:54:57,457 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-02-06 18:54:57,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:54:57,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:54:57,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1204685938, now seen corresponding path program 1 times [2025-02-06 18:54:57,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:54:57,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124910293] [2025-02-06 18:54:57,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:54:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:54:57,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:54:57,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:54:57,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:54:57,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:54:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:54:57,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:54:57,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124910293] [2025-02-06 18:54:57,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124910293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:54:57,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:54:57,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:54:57,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524229976] [2025-02-06 18:54:57,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:54:57,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:54:57,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:54:57,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:54:57,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:54:57,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 105 [2025-02-06 18:54:57,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 135 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-02-06 18:54:57,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:54:57,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 105 [2025-02-06 18:54:57,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:54:57,821 INFO L124 PetriNetUnfolderBase]: 1383/2641 cut-off events. [2025-02-06 18:54:57,822 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2025-02-06 18:54:57,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4749 conditions, 2641 events. 1383/2641 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17310 event pairs, 1018 based on Foata normal form. 1/1978 useless extension candidates. Maximal degree in co-relation 4646. Up to 1888 conditions per place. [2025-02-06 18:54:57,830 INFO L140 encePairwiseOnDemand]: 102/105 looper letters, 84 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2025-02-06 18:54:57,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 134 transitions, 773 flow [2025-02-06 18:54:57,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:54:57,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:54:57,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2025-02-06 18:54:57,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-02-06 18:54:57,831 INFO L175 Difference]: Start difference. First operand has 111 places, 135 transitions, 605 flow. Second operand 3 states and 213 transitions. [2025-02-06 18:54:57,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 134 transitions, 773 flow [2025-02-06 18:54:57,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 134 transitions, 736 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-02-06 18:54:57,834 INFO L231 Difference]: Finished difference. Result has 111 places, 134 transitions, 568 flow [2025-02-06 18:54:57,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=111, PETRI_TRANSITIONS=134} [2025-02-06 18:54:57,835 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2025-02-06 18:54:57,835 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 134 transitions, 568 flow [2025-02-06 18:54:57,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-02-06 18:54:57,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:54:57,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:54:57,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:54:57,835 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:54:57,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:54:57,836 INFO L85 PathProgramCache]: Analyzing trace with hash -651942143, now seen corresponding path program 1 times [2025-02-06 18:54:57,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:54:57,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113456708] [2025-02-06 18:54:57,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:54:57,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:54:57,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:54:57,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:54:57,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:54:57,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:54:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:54:57,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:54:57,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113456708] [2025-02-06 18:54:57,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113456708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:54:57,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:54:57,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:54:57,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312193399] [2025-02-06 18:54:57,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:54:57,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:54:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:54:57,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:54:57,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:54:57,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 105 [2025-02-06 18:54:57,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 134 transitions, 568 flow. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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-02-06 18:54:57,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:54:57,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 105 [2025-02-06 18:54:57,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:54:58,166 INFO L124 PetriNetUnfolderBase]: 1381/2639 cut-off events. [2025-02-06 18:54:58,167 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-02-06 18:54:58,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4723 conditions, 2639 events. 1381/2639 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17160 event pairs, 1018 based on Foata normal form. 2/1977 useless extension candidates. Maximal degree in co-relation 4697. Up to 1875 conditions per place. [2025-02-06 18:54:58,178 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 72 selfloop transitions, 12 changer transitions 0/132 dead transitions. [2025-02-06 18:54:58,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 132 transitions, 723 flow [2025-02-06 18:54:58,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:54:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:54:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2025-02-06 18:54:58,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2025-02-06 18:54:58,179 INFO L175 Difference]: Start difference. First operand has 111 places, 134 transitions, 568 flow. Second operand 4 states and 272 transitions. [2025-02-06 18:54:58,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 132 transitions, 723 flow [2025-02-06 18:54:58,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 132 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:54:58,182 INFO L231 Difference]: Finished difference. Result has 112 places, 132 transitions, 565 flow [2025-02-06 18:54:58,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=565, PETRI_PLACES=112, PETRI_TRANSITIONS=132} [2025-02-06 18:54:58,182 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 12 predicate places. [2025-02-06 18:54:58,182 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 132 transitions, 565 flow [2025-02-06 18:54:58,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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-02-06 18:54:58,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:54:58,183 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-02-06 18:54:58,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:54:58,183 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:54:58,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:54:58,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1797833976, now seen corresponding path program 2 times [2025-02-06 18:54:58,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:54:58,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825103946] [2025-02-06 18:54:58,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:54:58,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:54:58,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-06 18:54:58,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-06 18:54:58,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:54:58,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:54:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:54:58,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:54:58,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825103946] [2025-02-06 18:54:58,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825103946] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:54:58,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777173681] [2025-02-06 18:54:58,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:54:58,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:54:58,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:54:58,239 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-02-06 18:54:58,242 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-02-06 18:54:58,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-06 18:54:58,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-06 18:54:58,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:54:58,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:54:58,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:54:58,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:54:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:54:58,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:54:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:54:58,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777173681] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:54:58,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:54:58,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-02-06 18:54:58,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875734269] [2025-02-06 18:54:58,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:54:58,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:54:58,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:54:58,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:54:58,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:54:58,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-02-06 18:54:58,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 132 transitions, 565 flow. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 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-02-06 18:54:58,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:54:58,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-02-06 18:54:58,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:54:58,620 INFO L124 PetriNetUnfolderBase]: 1381/2638 cut-off events. [2025-02-06 18:54:58,620 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-02-06 18:54:58,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4722 conditions, 2638 events. 1381/2638 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17149 event pairs, 1018 based on Foata normal form. 1/1977 useless extension candidates. Maximal degree in co-relation 4626. Up to 1879 conditions per place. [2025-02-06 18:54:58,634 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 71 selfloop transitions, 15 changer transitions 0/131 dead transitions. [2025-02-06 18:54:58,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 131 transitions, 727 flow [2025-02-06 18:54:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:54:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:54:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2025-02-06 18:54:58,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5785714285714286 [2025-02-06 18:54:58,637 INFO L175 Difference]: Start difference. First operand has 112 places, 132 transitions, 565 flow. Second operand 4 states and 243 transitions. [2025-02-06 18:54:58,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 131 transitions, 727 flow [2025-02-06 18:54:58,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 131 transitions, 703 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:54:58,640 INFO L231 Difference]: Finished difference. Result has 111 places, 131 transitions, 561 flow [2025-02-06 18:54:58,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=561, PETRI_PLACES=111, PETRI_TRANSITIONS=131} [2025-02-06 18:54:58,641 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2025-02-06 18:54:58,642 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 131 transitions, 561 flow [2025-02-06 18:54:58,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 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-02-06 18:54:58,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:54:58,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:54:58,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 18:54:58,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:54:58,843 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:54:58,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:54:58,843 INFO L85 PathProgramCache]: Analyzing trace with hash -6733540, now seen corresponding path program 1 times [2025-02-06 18:54:58,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:54:58,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994431276] [2025-02-06 18:54:58,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:54:58,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:54:58,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 18:54:58,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:54:58,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:54:58,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:54:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:54:59,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:54:59,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994431276] [2025-02-06 18:54:59,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994431276] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:54:59,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295033035] [2025-02-06 18:54:59,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:54:59,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:54:59,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:54:59,065 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-02-06 18:54:59,073 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-02-06 18:54:59,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 18:54:59,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:54:59,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:54:59,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:54:59,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 18:54:59,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:54:59,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 18:54:59,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:54:59,215 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:54:59,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 18:54:59,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 18:54:59,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 18:54:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:54:59,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:54:59,276 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_100 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_100) c_~B~0.base) c_~B~0.offset) 9223372039002259456))) is different from false [2025-02-06 18:54:59,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:54:59,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-02-06 18:54:59,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:54:59,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-02-06 18:54:59,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-02-06 18:54:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-02-06 18:54:59,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295033035] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:54:59,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:54:59,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-06 18:54:59,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975657095] [2025-02-06 18:54:59,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:54:59,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 18:54:59,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:54:59,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 18:54:59,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2025-02-06 18:54:59,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 105 [2025-02-06 18:54:59,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 131 transitions, 561 flow. Second operand has 14 states, 14 states have (on average 37.857142857142854) internal successors, (530), 14 states have internal predecessors, (530), 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-02-06 18:54:59,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:54:59,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 105 [2025-02-06 18:54:59,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:54:59,881 INFO L124 PetriNetUnfolderBase]: 1379/2641 cut-off events. [2025-02-06 18:54:59,881 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-02-06 18:54:59,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4755 conditions, 2641 events. 1379/2641 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17161 event pairs, 1018 based on Foata normal form. 0/1975 useless extension candidates. Maximal degree in co-relation 4664. Up to 1841 conditions per place. [2025-02-06 18:54:59,892 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 86 selfloop transitions, 24 changer transitions 0/139 dead transitions. [2025-02-06 18:54:59,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 139 transitions, 797 flow [2025-02-06 18:54:59,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:54:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 18:54:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 477 transitions. [2025-02-06 18:54:59,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.412987012987013 [2025-02-06 18:54:59,894 INFO L175 Difference]: Start difference. First operand has 111 places, 131 transitions, 561 flow. Second operand 11 states and 477 transitions. [2025-02-06 18:54:59,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 139 transitions, 797 flow [2025-02-06 18:54:59,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 139 transitions, 767 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:54:59,896 INFO L231 Difference]: Finished difference. Result has 117 places, 130 transitions, 577 flow [2025-02-06 18:54:59,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=577, PETRI_PLACES=117, PETRI_TRANSITIONS=130} [2025-02-06 18:54:59,897 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 17 predicate places. [2025-02-06 18:54:59,897 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 130 transitions, 577 flow [2025-02-06 18:54:59,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 37.857142857142854) internal successors, (530), 14 states have internal predecessors, (530), 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-02-06 18:54:59,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:54:59,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:54:59,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 18:55:00,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-06 18:55:00,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:00,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:00,103 INFO L85 PathProgramCache]: Analyzing trace with hash -208709507, now seen corresponding path program 1 times [2025-02-06 18:55:00,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:00,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218752040] [2025-02-06 18:55:00,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:00,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:00,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 18:55:00,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 18:55:00,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:00,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:55:00,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:00,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218752040] [2025-02-06 18:55:00,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218752040] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:55:00,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684081469] [2025-02-06 18:55:00,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:00,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:00,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:55:00,367 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-02-06 18:55:00,369 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-02-06 18:55:00,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 18:55:00,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 18:55:00,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:00,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:00,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 18:55:00,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:55:00,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 18:55:00,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:55:00,486 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:55:00,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 18:55:00,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:55:00,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 18:55:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:55:00,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:55:00,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:00,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-02-06 18:55:00,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:00,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-02-06 18:55:00,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-02-06 18:55:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:55:00,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684081469] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:55:00,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:55:00,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-06 18:55:00,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360267797] [2025-02-06 18:55:00,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:55:00,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 18:55:00,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:00,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 18:55:00,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=145, Unknown=1, NotChecked=0, Total=182 [2025-02-06 18:55:00,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 105 [2025-02-06 18:55:00,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 130 transitions, 577 flow. Second operand has 14 states, 14 states have (on average 37.857142857142854) internal successors, (530), 14 states have internal predecessors, (530), 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-02-06 18:55:00,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:00,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 105 [2025-02-06 18:55:00,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:01,191 INFO L124 PetriNetUnfolderBase]: 1379/2640 cut-off events. [2025-02-06 18:55:01,191 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2025-02-06 18:55:01,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4761 conditions, 2640 events. 1379/2640 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17168 event pairs, 1018 based on Foata normal form. 1/1978 useless extension candidates. Maximal degree in co-relation 4666. Up to 1845 conditions per place. [2025-02-06 18:55:01,200 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 79 selfloop transitions, 25 changer transitions 0/133 dead transitions. [2025-02-06 18:55:01,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 133 transitions, 789 flow [2025-02-06 18:55:01,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:55:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 18:55:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 469 transitions. [2025-02-06 18:55:01,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2025-02-06 18:55:01,202 INFO L175 Difference]: Start difference. First operand has 117 places, 130 transitions, 577 flow. Second operand 11 states and 469 transitions. [2025-02-06 18:55:01,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 133 transitions, 789 flow [2025-02-06 18:55:01,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 133 transitions, 762 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 18:55:01,205 INFO L231 Difference]: Finished difference. Result has 122 places, 129 transitions, 596 flow [2025-02-06 18:55:01,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=596, PETRI_PLACES=122, PETRI_TRANSITIONS=129} [2025-02-06 18:55:01,205 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 22 predicate places. [2025-02-06 18:55:01,206 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 129 transitions, 596 flow [2025-02-06 18:55:01,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 37.857142857142854) internal successors, (530), 14 states have internal predecessors, (530), 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-02-06 18:55:01,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:01,206 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:01,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 18:55:01,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:01,409 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:01,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:01,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2119942174, now seen corresponding path program 1 times [2025-02-06 18:55:01,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:01,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620796113] [2025-02-06 18:55:01,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:01,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:01,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 18:55:01,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 18:55:01,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:01,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:55:01,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:01,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620796113] [2025-02-06 18:55:01,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620796113] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:55:01,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818946433] [2025-02-06 18:55:01,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:01,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:01,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:55:01,707 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-02-06 18:55:01,709 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-02-06 18:55:01,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 18:55:01,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 18:55:01,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:01,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:01,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 18:55:01,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:55:01,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 18:55:01,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:55:01,853 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 18:55:01,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 18:55:01,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 18:55:01,901 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:55:01,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 18:55:01,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 18:55:01,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 18:55:01,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:55:01,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:55:02,017 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_157 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_157) c_~A~0.base) c_~A~0.offset)))) is different from false [2025-02-06 18:55:02,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:02,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-02-06 18:55:02,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:02,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 135 [2025-02-06 18:55:02,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-02-06 18:55:02,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-02-06 18:55:02,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-06 18:55:02,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818946433] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:55:02,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:55:02,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-02-06 18:55:02,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58894683] [2025-02-06 18:55:02,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:55:02,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 18:55:02,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:02,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 18:55:02,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=225, Unknown=2, NotChecked=30, Total=306 [2025-02-06 18:55:02,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 105 [2025-02-06 18:55:02,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 129 transitions, 596 flow. Second operand has 18 states, 18 states have (on average 33.611111111111114) internal successors, (605), 18 states have internal predecessors, (605), 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-02-06 18:55:02,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:02,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 105 [2025-02-06 18:55:02,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:02,925 INFO L124 PetriNetUnfolderBase]: 1378/2636 cut-off events. [2025-02-06 18:55:02,925 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2025-02-06 18:55:02,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4763 conditions, 2636 events. 1378/2636 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17116 event pairs, 1018 based on Foata normal form. 1/1977 useless extension candidates. Maximal degree in co-relation 4668. Up to 1842 conditions per place. [2025-02-06 18:55:02,935 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 81 selfloop transitions, 28 changer transitions 0/134 dead transitions. [2025-02-06 18:55:02,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 134 transitions, 822 flow [2025-02-06 18:55:02,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:55:02,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 18:55:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 534 transitions. [2025-02-06 18:55:02,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.363265306122449 [2025-02-06 18:55:02,937 INFO L175 Difference]: Start difference. First operand has 122 places, 129 transitions, 596 flow. Second operand 14 states and 534 transitions. [2025-02-06 18:55:02,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 134 transitions, 822 flow [2025-02-06 18:55:02,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 134 transitions, 770 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-02-06 18:55:02,940 INFO L231 Difference]: Finished difference. Result has 126 places, 128 transitions, 608 flow [2025-02-06 18:55:02,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=608, PETRI_PLACES=126, PETRI_TRANSITIONS=128} [2025-02-06 18:55:02,941 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 26 predicate places. [2025-02-06 18:55:02,941 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 128 transitions, 608 flow [2025-02-06 18:55:02,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 33.611111111111114) internal successors, (605), 18 states have internal predecessors, (605), 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-02-06 18:55:02,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:02,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:02,947 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-02-06 18:55:03,141 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,SelfDestructingSolverStorable9 [2025-02-06 18:55:03,142 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:03,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:03,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1293698767, now seen corresponding path program 1 times [2025-02-06 18:55:03,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:03,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969542717] [2025-02-06 18:55:03,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:03,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:03,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 18:55:03,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 18:55:03,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:03,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:55:03,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:03,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969542717] [2025-02-06 18:55:03,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969542717] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:55:03,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768952571] [2025-02-06 18:55:03,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:03,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:03,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:55:03,406 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-02-06 18:55:03,409 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-02-06 18:55:03,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 18:55:03,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 18:55:03,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:03,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:03,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 18:55:03,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:55:03,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 18:55:03,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:55:03,530 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 18:55:03,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 18:55:03,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:55:03,557 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:55:03,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 18:55:03,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:55:03,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 18:55:03,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:55:03,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:55:03,641 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_186 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_186) c_~A~0.base) c_~A~0.offset) 2147483648)) is different from false [2025-02-06 18:55:03,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:03,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-02-06 18:55:03,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:03,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 117 [2025-02-06 18:55:03,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-02-06 18:55:03,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-06 18:55:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-06 18:55:03,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768952571] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:55:03,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:55:03,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-06 18:55:03,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173014878] [2025-02-06 18:55:03,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:55:03,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 18:55:03,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:03,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 18:55:03,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=287, Unknown=2, NotChecked=34, Total=380 [2025-02-06 18:55:03,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 105 [2025-02-06 18:55:03,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 128 transitions, 608 flow. Second operand has 20 states, 20 states have (on average 33.6) internal successors, (672), 20 states have internal predecessors, (672), 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-02-06 18:55:03,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:03,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 105 [2025-02-06 18:55:03,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:04,537 INFO L124 PetriNetUnfolderBase]: 1378/2636 cut-off events. [2025-02-06 18:55:04,537 INFO L125 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2025-02-06 18:55:04,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4782 conditions, 2636 events. 1378/2636 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17156 event pairs, 1018 based on Foata normal form. 4/1982 useless extension candidates. Maximal degree in co-relation 4709. Up to 1846 conditions per place. [2025-02-06 18:55:04,546 INFO L140 encePairwiseOnDemand]: 84/105 looper letters, 75 selfloop transitions, 32 changer transitions 1/133 dead transitions. [2025-02-06 18:55:04,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 133 transitions, 846 flow [2025-02-06 18:55:04,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 18:55:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-06 18:55:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 623 transitions. [2025-02-06 18:55:04,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34901960784313724 [2025-02-06 18:55:04,548 INFO L175 Difference]: Start difference. First operand has 126 places, 128 transitions, 608 flow. Second operand 17 states and 623 transitions. [2025-02-06 18:55:04,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 133 transitions, 846 flow [2025-02-06 18:55:04,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 133 transitions, 824 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-06 18:55:04,550 INFO L231 Difference]: Finished difference. Result has 140 places, 131 transitions, 679 flow [2025-02-06 18:55:04,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=679, PETRI_PLACES=140, PETRI_TRANSITIONS=131} [2025-02-06 18:55:04,551 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 40 predicate places. [2025-02-06 18:55:04,551 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 131 transitions, 679 flow [2025-02-06 18:55:04,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 33.6) internal successors, (672), 20 states have internal predecessors, (672), 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-02-06 18:55:04,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:04,551 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:04,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 18:55:04,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:04,752 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:04,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:04,752 INFO L85 PathProgramCache]: Analyzing trace with hash 535696082, now seen corresponding path program 1 times [2025-02-06 18:55:04,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:04,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766600453] [2025-02-06 18:55:04,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:04,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:04,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 18:55:04,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:55:04,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:04,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 18:55:04,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:04,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766600453] [2025-02-06 18:55:04,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766600453] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:55:04,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554799525] [2025-02-06 18:55:04,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:04,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:04,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:55:04,857 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-02-06 18:55:04,858 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-02-06 18:55:04,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 18:55:04,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:55:04,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:04,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:04,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 18:55:04,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:55:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 18:55:04,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:55:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 18:55:05,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554799525] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:55:05,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:55:05,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-02-06 18:55:05,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411178064] [2025-02-06 18:55:05,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:55:05,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 18:55:05,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:05,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 18:55:05,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-02-06 18:55:05,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-02-06 18:55:05,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 131 transitions, 679 flow. Second operand has 21 states, 21 states have (on average 49.285714285714285) internal successors, (1035), 21 states have internal predecessors, (1035), 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-02-06 18:55:05,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:05,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-02-06 18:55:05,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:05,811 INFO L124 PetriNetUnfolderBase]: 2743/5220 cut-off events. [2025-02-06 18:55:05,812 INFO L125 PetriNetUnfolderBase]: For 381/381 co-relation queries the response was YES. [2025-02-06 18:55:05,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9361 conditions, 5220 events. 2743/5220 cut-off events. For 381/381 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 36021 event pairs, 2036 based on Foata normal form. 2/3938 useless extension candidates. Maximal degree in co-relation 9310. Up to 1863 conditions per place. [2025-02-06 18:55:05,890 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 93 selfloop transitions, 46 changer transitions 0/181 dead transitions. [2025-02-06 18:55:05,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 181 transitions, 1184 flow [2025-02-06 18:55:05,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:55:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 18:55:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 639 transitions. [2025-02-06 18:55:05,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5532467532467532 [2025-02-06 18:55:05,892 INFO L175 Difference]: Start difference. First operand has 140 places, 131 transitions, 679 flow. Second operand 11 states and 639 transitions. [2025-02-06 18:55:05,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 181 transitions, 1184 flow [2025-02-06 18:55:05,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 181 transitions, 1118 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-02-06 18:55:05,895 INFO L231 Difference]: Finished difference. Result has 141 places, 137 transitions, 774 flow [2025-02-06 18:55:05,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=774, PETRI_PLACES=141, PETRI_TRANSITIONS=137} [2025-02-06 18:55:05,896 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 41 predicate places. [2025-02-06 18:55:05,896 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 137 transitions, 774 flow [2025-02-06 18:55:05,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 49.285714285714285) internal successors, (1035), 21 states have internal predecessors, (1035), 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-02-06 18:55:05,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:05,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:05,902 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-02-06 18:55:06,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:06,100 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:06,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:06,100 INFO L85 PathProgramCache]: Analyzing trace with hash 574936650, now seen corresponding path program 1 times [2025-02-06 18:55:06,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:06,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307694299] [2025-02-06 18:55:06,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:06,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:06,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 18:55:06,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:55:06,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:06,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:55:06,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:06,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307694299] [2025-02-06 18:55:06,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307694299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:55:06,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:55:06,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:55:06,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738108698] [2025-02-06 18:55:06,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:55:06,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:55:06,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:06,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:55:06,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:55:06,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 105 [2025-02-06 18:55:06,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 137 transitions, 774 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-02-06 18:55:06,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:06,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 105 [2025-02-06 18:55:06,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:06,604 INFO L124 PetriNetUnfolderBase]: 2743/5208 cut-off events. [2025-02-06 18:55:06,604 INFO L125 PetriNetUnfolderBase]: For 359/359 co-relation queries the response was YES. [2025-02-06 18:55:06,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9378 conditions, 5208 events. 2743/5208 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 36221 event pairs, 2036 based on Foata normal form. 2/3900 useless extension candidates. Maximal degree in co-relation 9327. Up to 3731 conditions per place. [2025-02-06 18:55:06,619 INFO L140 encePairwiseOnDemand]: 91/105 looper letters, 88 selfloop transitions, 20 changer transitions 0/139 dead transitions. [2025-02-06 18:55:06,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 139 transitions, 994 flow [2025-02-06 18:55:06,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:55:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:55:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 298 transitions. [2025-02-06 18:55:06,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.473015873015873 [2025-02-06 18:55:06,621 INFO L175 Difference]: Start difference. First operand has 141 places, 137 transitions, 774 flow. Second operand 6 states and 298 transitions. [2025-02-06 18:55:06,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 139 transitions, 994 flow [2025-02-06 18:55:06,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 139 transitions, 913 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-02-06 18:55:06,624 INFO L231 Difference]: Finished difference. Result has 140 places, 139 transitions, 763 flow [2025-02-06 18:55:06,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=763, PETRI_PLACES=140, PETRI_TRANSITIONS=139} [2025-02-06 18:55:06,625 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 40 predicate places. [2025-02-06 18:55:06,625 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 139 transitions, 763 flow [2025-02-06 18:55:06,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-02-06 18:55:06,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:06,625 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1] [2025-02-06 18:55:06,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 18:55:06,625 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:06,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:06,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1040732735, now seen corresponding path program 2 times [2025-02-06 18:55:06,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:06,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091144324] [2025-02-06 18:55:06,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:55:06,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:06,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-06 18:55:06,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-02-06 18:55:06,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:55:06,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 18:55:06,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091144324] [2025-02-06 18:55:06,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091144324] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:55:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773337808] [2025-02-06 18:55:06,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:55:06,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:06,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:55:06,662 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-02-06 18:55:06,663 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-02-06 18:55:06,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-06 18:55:06,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-02-06 18:55:06,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:55:06,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:06,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:55:06,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:55:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 18:55:06,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:55:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 18:55:06,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773337808] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:55:06,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:55:06,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-02-06 18:55:06,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361397556] [2025-02-06 18:55:06,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:55:06,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:55:06,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:06,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:55:06,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:55:06,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-02-06 18:55:06,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 139 transitions, 763 flow. Second operand has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 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-02-06 18:55:06,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:06,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-02-06 18:55:06,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:07,246 INFO L124 PetriNetUnfolderBase]: 2745/5206 cut-off events. [2025-02-06 18:55:07,246 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2025-02-06 18:55:07,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9350 conditions, 5206 events. 2745/5206 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 36185 event pairs, 2036 based on Foata normal form. 2/3898 useless extension candidates. Maximal degree in co-relation 9298. Up to 3699 conditions per place. [2025-02-06 18:55:07,269 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 55 selfloop transitions, 40 changer transitions 0/137 dead transitions. [2025-02-06 18:55:07,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 137 transitions, 933 flow [2025-02-06 18:55:07,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:55:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:55:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 290 transitions. [2025-02-06 18:55:07,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2025-02-06 18:55:07,270 INFO L175 Difference]: Start difference. First operand has 140 places, 139 transitions, 763 flow. Second operand 5 states and 290 transitions. [2025-02-06 18:55:07,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 137 transitions, 933 flow [2025-02-06 18:55:07,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 137 transitions, 873 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-02-06 18:55:07,274 INFO L231 Difference]: Finished difference. Result has 134 places, 137 transitions, 763 flow [2025-02-06 18:55:07,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=763, PETRI_PLACES=134, PETRI_TRANSITIONS=137} [2025-02-06 18:55:07,274 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 34 predicate places. [2025-02-06 18:55:07,274 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 137 transitions, 763 flow [2025-02-06 18:55:07,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 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-02-06 18:55:07,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:07,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:07,281 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-02-06 18:55:07,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:07,475 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:07,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:07,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1186625962, now seen corresponding path program 1 times [2025-02-06 18:55:07,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:07,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944956666] [2025-02-06 18:55:07,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:07,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:07,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 18:55:07,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 18:55:07,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:07,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:55:07,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:07,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944956666] [2025-02-06 18:55:07,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944956666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:55:07,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:55:07,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:55:07,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209393663] [2025-02-06 18:55:07,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:55:07,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:55:07,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:07,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:55:07,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:55:07,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 105 [2025-02-06 18:55:07,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 137 transitions, 763 flow. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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-02-06 18:55:07,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:07,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 105 [2025-02-06 18:55:07,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:08,188 INFO L124 PetriNetUnfolderBase]: 5665/9778 cut-off events. [2025-02-06 18:55:08,188 INFO L125 PetriNetUnfolderBase]: For 342/342 co-relation queries the response was YES. [2025-02-06 18:55:08,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17861 conditions, 9778 events. 5665/9778 cut-off events. For 342/342 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 70333 event pairs, 3132 based on Foata normal form. 284/7382 useless extension candidates. Maximal degree in co-relation 17816. Up to 5784 conditions per place. [2025-02-06 18:55:08,225 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 136 selfloop transitions, 4 changer transitions 0/180 dead transitions. [2025-02-06 18:55:08,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 180 transitions, 1133 flow [2025-02-06 18:55:08,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:55:08,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:55:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 303 transitions. [2025-02-06 18:55:08,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7214285714285714 [2025-02-06 18:55:08,226 INFO L175 Difference]: Start difference. First operand has 134 places, 137 transitions, 763 flow. Second operand 4 states and 303 transitions. [2025-02-06 18:55:08,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 180 transitions, 1133 flow [2025-02-06 18:55:08,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 180 transitions, 1058 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:55:08,229 INFO L231 Difference]: Finished difference. Result has 136 places, 140 transitions, 717 flow [2025-02-06 18:55:08,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=717, PETRI_PLACES=136, PETRI_TRANSITIONS=140} [2025-02-06 18:55:08,229 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 36 predicate places. [2025-02-06 18:55:08,229 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 140 transitions, 717 flow [2025-02-06 18:55:08,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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-02-06 18:55:08,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:08,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:08,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 18:55:08,230 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:08,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:08,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2137068283, now seen corresponding path program 1 times [2025-02-06 18:55:08,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:08,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332618807] [2025-02-06 18:55:08,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:08,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:08,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 18:55:08,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 18:55:08,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:08,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:08,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:55:08,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:08,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332618807] [2025-02-06 18:55:08,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332618807] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:55:08,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865514242] [2025-02-06 18:55:08,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:08,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:08,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:55:08,317 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-02-06 18:55:08,318 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-02-06 18:55:08,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 18:55:08,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 18:55:08,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:08,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:08,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 18:55:08,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:55:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:55:08,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:55:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:55:08,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865514242] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:55:08,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:55:08,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-02-06 18:55:08,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623616404] [2025-02-06 18:55:08,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:55:08,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 18:55:08,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:08,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 18:55:08,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-02-06 18:55:08,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 105 [2025-02-06 18:55:08,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 140 transitions, 717 flow. Second operand has 15 states, 15 states have (on average 49.06666666666667) internal successors, (736), 15 states have internal predecessors, (736), 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-02-06 18:55:08,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:08,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 105 [2025-02-06 18:55:08,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:09,155 INFO L124 PetriNetUnfolderBase]: 2982/5218 cut-off events. [2025-02-06 18:55:09,155 INFO L125 PetriNetUnfolderBase]: For 2146/2435 co-relation queries the response was YES. [2025-02-06 18:55:09,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11613 conditions, 5218 events. 2982/5218 cut-off events. For 2146/2435 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 32148 event pairs, 2064 based on Foata normal form. 0/4154 useless extension candidates. Maximal degree in co-relation 11566. Up to 3246 conditions per place. [2025-02-06 18:55:09,179 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 111 selfloop transitions, 45 changer transitions 0/197 dead transitions. [2025-02-06 18:55:09,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 197 transitions, 1254 flow [2025-02-06 18:55:09,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:55:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 18:55:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 631 transitions. [2025-02-06 18:55:09,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5463203463203463 [2025-02-06 18:55:09,180 INFO L175 Difference]: Start difference. First operand has 136 places, 140 transitions, 717 flow. Second operand 11 states and 631 transitions. [2025-02-06 18:55:09,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 197 transitions, 1254 flow [2025-02-06 18:55:09,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 197 transitions, 1245 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:55:09,185 INFO L231 Difference]: Finished difference. Result has 147 places, 142 transitions, 820 flow [2025-02-06 18:55:09,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=820, PETRI_PLACES=147, PETRI_TRANSITIONS=142} [2025-02-06 18:55:09,186 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 47 predicate places. [2025-02-06 18:55:09,186 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 142 transitions, 820 flow [2025-02-06 18:55:09,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 49.06666666666667) internal successors, (736), 15 states have internal predecessors, (736), 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-02-06 18:55:09,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:09,187 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:09,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 18:55:09,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 18:55:09,387 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:09,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:09,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1100898770, now seen corresponding path program 1 times [2025-02-06 18:55:09,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:09,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889705719] [2025-02-06 18:55:09,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:09,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 18:55:09,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 18:55:09,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:09,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:55:09,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:09,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889705719] [2025-02-06 18:55:09,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889705719] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:55:09,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645589081] [2025-02-06 18:55:09,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:09,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:09,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:55:09,477 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:55:09,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 18:55:09,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 18:55:09,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 18:55:09,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:09,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:09,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 18:55:09,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:55:09,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:55:09,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:55:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:55:09,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645589081] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:55:09,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:55:09,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-02-06 18:55:09,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557619645] [2025-02-06 18:55:09,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:55:09,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 18:55:09,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:09,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 18:55:09,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-02-06 18:55:09,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-02-06 18:55:09,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 142 transitions, 820 flow. Second operand has 15 states, 15 states have (on average 50.0) internal successors, (750), 15 states have internal predecessors, (750), 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-02-06 18:55:09,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:09,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-02-06 18:55:09,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:10,240 INFO L124 PetriNetUnfolderBase]: 2378/4508 cut-off events. [2025-02-06 18:55:10,240 INFO L125 PetriNetUnfolderBase]: For 1746/1954 co-relation queries the response was YES. [2025-02-06 18:55:10,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9604 conditions, 4508 events. 2378/4508 cut-off events. For 1746/1954 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 31264 event pairs, 1672 based on Foata normal form. 44/3656 useless extension candidates. Maximal degree in co-relation 9555. Up to 2813 conditions per place. [2025-02-06 18:55:10,256 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 101 selfloop transitions, 45 changer transitions 0/188 dead transitions. [2025-02-06 18:55:10,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 188 transitions, 1289 flow [2025-02-06 18:55:10,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:55:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 18:55:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 638 transitions. [2025-02-06 18:55:10,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2025-02-06 18:55:10,258 INFO L175 Difference]: Start difference. First operand has 147 places, 142 transitions, 820 flow. Second operand 11 states and 638 transitions. [2025-02-06 18:55:10,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 188 transitions, 1289 flow [2025-02-06 18:55:10,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 188 transitions, 1205 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 18:55:10,266 INFO L231 Difference]: Finished difference. Result has 151 places, 144 transitions, 846 flow [2025-02-06 18:55:10,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=846, PETRI_PLACES=151, PETRI_TRANSITIONS=144} [2025-02-06 18:55:10,267 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 51 predicate places. [2025-02-06 18:55:10,267 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 144 transitions, 846 flow [2025-02-06 18:55:10,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 50.0) internal successors, (750), 15 states have internal predecessors, (750), 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-02-06 18:55:10,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:10,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:10,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 18:55:10,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 18:55:10,468 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:10,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:10,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1320083278, now seen corresponding path program 1 times [2025-02-06 18:55:10,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:10,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323448746] [2025-02-06 18:55:10,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:10,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:10,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 18:55:10,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 18:55:10,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:10,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:55:10,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:10,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323448746] [2025-02-06 18:55:10,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323448746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:55:10,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:55:10,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:55:10,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179000443] [2025-02-06 18:55:10,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:55:10,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:55:10,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:10,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:55:10,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:55:10,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 105 [2025-02-06 18:55:10,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 144 transitions, 846 flow. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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-02-06 18:55:10,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:10,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 105 [2025-02-06 18:55:10,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:11,206 INFO L124 PetriNetUnfolderBase]: 5436/9302 cut-off events. [2025-02-06 18:55:11,206 INFO L125 PetriNetUnfolderBase]: For 6467/6812 co-relation queries the response was YES. [2025-02-06 18:55:11,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21941 conditions, 9302 events. 5436/9302 cut-off events. For 6467/6812 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 63326 event pairs, 2711 based on Foata normal form. 153/7629 useless extension candidates. Maximal degree in co-relation 21856. Up to 4812 conditions per place. [2025-02-06 18:55:11,249 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 164 selfloop transitions, 3 changer transitions 0/206 dead transitions. [2025-02-06 18:55:11,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 206 transitions, 1423 flow [2025-02-06 18:55:11,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:55:11,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:55:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 302 transitions. [2025-02-06 18:55:11,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.719047619047619 [2025-02-06 18:55:11,250 INFO L175 Difference]: Start difference. First operand has 151 places, 144 transitions, 846 flow. Second operand 4 states and 302 transitions. [2025-02-06 18:55:11,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 206 transitions, 1423 flow [2025-02-06 18:55:11,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 206 transitions, 1339 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 18:55:11,259 INFO L231 Difference]: Finished difference. Result has 148 places, 146 transitions, 784 flow [2025-02-06 18:55:11,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=784, PETRI_PLACES=148, PETRI_TRANSITIONS=146} [2025-02-06 18:55:11,260 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 48 predicate places. [2025-02-06 18:55:11,260 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 146 transitions, 784 flow [2025-02-06 18:55:11,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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-02-06 18:55:11,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:11,260 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:11,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 18:55:11,260 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:11,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:11,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1391112247, now seen corresponding path program 2 times [2025-02-06 18:55:11,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:11,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891895871] [2025-02-06 18:55:11,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:55:11,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:11,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 18:55:11,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:55:11,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:55:11,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 18:55:11,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:11,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891895871] [2025-02-06 18:55:11,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891895871] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:55:11,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190107760] [2025-02-06 18:55:11,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:55:11,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:11,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:55:11,624 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:55:11,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 18:55:11,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 18:55:11,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:55:11,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:55:11,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:11,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 18:55:11,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:55:11,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 18:55:11,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 18:55:11,782 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:55:11,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 18:55:11,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 18:55:11,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 18:55:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 18:55:11,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:55:11,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:11,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-02-06 18:55:11,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:11,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2025-02-06 18:55:11,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 18:55:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 18:55:12,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190107760] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:55:12,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:55:12,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2025-02-06 18:55:12,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924253945] [2025-02-06 18:55:12,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:55:12,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 18:55:12,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:12,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 18:55:12,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=473, Unknown=3, NotChecked=0, Total=552 [2025-02-06 18:55:12,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-02-06 18:55:12,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 146 transitions, 784 flow. Second operand has 24 states, 24 states have (on average 46.208333333333336) internal successors, (1109), 24 states have internal predecessors, (1109), 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-02-06 18:55:12,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:12,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-02-06 18:55:12,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:13,810 INFO L124 PetriNetUnfolderBase]: 7277/11637 cut-off events. [2025-02-06 18:55:13,811 INFO L125 PetriNetUnfolderBase]: For 9814/11083 co-relation queries the response was YES. [2025-02-06 18:55:13,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30031 conditions, 11637 events. 7277/11637 cut-off events. For 9814/11083 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 75444 event pairs, 1863 based on Foata normal form. 245/9673 useless extension candidates. Maximal degree in co-relation 29910. Up to 3441 conditions per place. [2025-02-06 18:55:13,868 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 170 selfloop transitions, 43 changer transitions 0/251 dead transitions. [2025-02-06 18:55:13,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 251 transitions, 1631 flow [2025-02-06 18:55:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 18:55:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-06 18:55:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 844 transitions. [2025-02-06 18:55:13,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5023809523809524 [2025-02-06 18:55:13,873 INFO L175 Difference]: Start difference. First operand has 148 places, 146 transitions, 784 flow. Second operand 16 states and 844 transitions. [2025-02-06 18:55:13,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 251 transitions, 1631 flow [2025-02-06 18:55:13,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 251 transitions, 1621 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:55:13,887 INFO L231 Difference]: Finished difference. Result has 164 places, 154 transitions, 931 flow [2025-02-06 18:55:13,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=931, PETRI_PLACES=164, PETRI_TRANSITIONS=154} [2025-02-06 18:55:13,888 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 64 predicate places. [2025-02-06 18:55:13,888 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 154 transitions, 931 flow [2025-02-06 18:55:13,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 46.208333333333336) internal successors, (1109), 24 states have internal predecessors, (1109), 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-02-06 18:55:13,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:13,889 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:13,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-06 18:55:14,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:14,090 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:14,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:14,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1391112246, now seen corresponding path program 1 times [2025-02-06 18:55:14,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:14,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804673390] [2025-02-06 18:55:14,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:14,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:14,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 18:55:14,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:55:14,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:14,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:55:14,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:14,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804673390] [2025-02-06 18:55:14,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804673390] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:55:14,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523443952] [2025-02-06 18:55:14,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:14,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:14,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:55:14,612 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:55:14,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 18:55:14,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 18:55:14,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:55:14,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:14,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:14,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 18:55:14,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:55:14,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 18:55:14,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 18:55:14,774 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:55:14,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 18:55:14,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 18:55:14,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 18:55:14,841 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 18:55:14,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:55:14,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:14,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-02-06 18:55:14,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:14,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2025-02-06 18:55:14,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:55:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 18:55:15,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523443952] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:55:15,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:55:15,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 27 [2025-02-06 18:55:15,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302288412] [2025-02-06 18:55:15,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:55:15,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 18:55:15,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:15,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 18:55:15,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=664, Unknown=5, NotChecked=0, Total=756 [2025-02-06 18:55:15,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-02-06 18:55:15,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 154 transitions, 931 flow. Second operand has 28 states, 28 states have (on average 44.964285714285715) internal successors, (1259), 28 states have internal predecessors, (1259), 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-02-06 18:55:15,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:15,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-02-06 18:55:15,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:17,121 INFO L124 PetriNetUnfolderBase]: 7964/12739 cut-off events. [2025-02-06 18:55:17,122 INFO L125 PetriNetUnfolderBase]: For 12076/13219 co-relation queries the response was YES. [2025-02-06 18:55:17,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35549 conditions, 12739 events. 7964/12739 cut-off events. For 12076/13219 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 81283 event pairs, 1997 based on Foata normal form. 174/10410 useless extension candidates. Maximal degree in co-relation 35460. Up to 3885 conditions per place. [2025-02-06 18:55:17,182 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 153 selfloop transitions, 39 changer transitions 0/229 dead transitions. [2025-02-06 18:55:17,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 229 transitions, 1560 flow [2025-02-06 18:55:17,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 18:55:17,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-06 18:55:17,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 946 transitions. [2025-02-06 18:55:17,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4741854636591479 [2025-02-06 18:55:17,184 INFO L175 Difference]: Start difference. First operand has 164 places, 154 transitions, 931 flow. Second operand 19 states and 946 transitions. [2025-02-06 18:55:17,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 229 transitions, 1560 flow [2025-02-06 18:55:17,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 229 transitions, 1525 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-06 18:55:17,198 INFO L231 Difference]: Finished difference. Result has 177 places, 149 transitions, 920 flow [2025-02-06 18:55:17,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=920, PETRI_PLACES=177, PETRI_TRANSITIONS=149} [2025-02-06 18:55:17,198 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 77 predicate places. [2025-02-06 18:55:17,198 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 149 transitions, 920 flow [2025-02-06 18:55:17,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 44.964285714285715) internal successors, (1259), 28 states have internal predecessors, (1259), 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-02-06 18:55:17,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:17,199 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:17,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 18:55:17,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:17,400 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:17,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:17,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1391112243, now seen corresponding path program 1 times [2025-02-06 18:55:17,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:17,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289437961] [2025-02-06 18:55:17,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:17,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:17,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 18:55:17,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:55:17,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:17,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:55:17,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:17,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289437961] [2025-02-06 18:55:17,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289437961] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:55:17,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106623847] [2025-02-06 18:55:17,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:17,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:17,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:55:17,790 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:55:17,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 18:55:17,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 18:55:17,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:55:17,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:17,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:17,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 18:55:17,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:55:17,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 18:55:17,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:55:17,938 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:55:17,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 18:55:17,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:55:17,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:55:17,989 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 18:55:17,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-06 18:55:18,066 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-02-06 18:55:18,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-02-06 18:55:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:55:18,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:55:18,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:18,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-02-06 18:55:18,259 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int))) (or (< 2147483647 (select v_arrayElimArr_7 4)) (< (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_7) c_~A~0.base) (+ c_~A~0.offset 4)) 2147483648))) is different from false [2025-02-06 18:55:18,274 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_203| Int)) (or (< 2147483647 (select v_arrayElimArr_7 4)) (< (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_458) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_203| v_arrayElimArr_7) c_~A~0.base) (+ c_~A~0.offset 4)) 2147483648))) is different from false [2025-02-06 18:55:18,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:18,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-02-06 18:55:18,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:18,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 129 [2025-02-06 18:55:18,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2025-02-06 18:55:18,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:18,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2025-02-06 18:55:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-02-06 18:55:18,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106623847] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:55:18,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:55:18,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 23 [2025-02-06 18:55:18,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185613207] [2025-02-06 18:55:18,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:55:18,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 18:55:18,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:18,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 18:55:18,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=416, Unknown=16, NotChecked=86, Total=600 [2025-02-06 18:55:18,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-02-06 18:55:18,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 149 transitions, 920 flow. Second operand has 25 states, 25 states have (on average 45.96) internal successors, (1149), 25 states have internal predecessors, (1149), 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-02-06 18:55:18,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:18,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-02-06 18:55:18,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:20,323 INFO L124 PetriNetUnfolderBase]: 6302/10386 cut-off events. [2025-02-06 18:55:20,323 INFO L125 PetriNetUnfolderBase]: For 10394/11314 co-relation queries the response was YES. [2025-02-06 18:55:20,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29763 conditions, 10386 events. 6302/10386 cut-off events. For 10394/11314 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 67728 event pairs, 3317 based on Foata normal form. 159/9122 useless extension candidates. Maximal degree in co-relation 29675. Up to 5276 conditions per place. [2025-02-06 18:55:20,385 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 154 selfloop transitions, 33 changer transitions 0/225 dead transitions. [2025-02-06 18:55:20,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 225 transitions, 1583 flow [2025-02-06 18:55:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 18:55:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 18:55:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 786 transitions. [2025-02-06 18:55:20,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4990476190476191 [2025-02-06 18:55:20,387 INFO L175 Difference]: Start difference. First operand has 177 places, 149 transitions, 920 flow. Second operand 15 states and 786 transitions. [2025-02-06 18:55:20,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 225 transitions, 1583 flow [2025-02-06 18:55:20,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 225 transitions, 1488 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-02-06 18:55:20,400 INFO L231 Difference]: Finished difference. Result has 173 places, 148 transitions, 887 flow [2025-02-06 18:55:20,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=887, PETRI_PLACES=173, PETRI_TRANSITIONS=148} [2025-02-06 18:55:20,401 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 73 predicate places. [2025-02-06 18:55:20,401 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 148 transitions, 887 flow [2025-02-06 18:55:20,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 45.96) internal successors, (1149), 25 states have internal predecessors, (1149), 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-02-06 18:55:20,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:20,402 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:20,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-06 18:55:20,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-06 18:55:20,606 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:20,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:20,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1391112244, now seen corresponding path program 1 times [2025-02-06 18:55:20,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:20,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575081960] [2025-02-06 18:55:20,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:20,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:20,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 18:55:20,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:55:20,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:20,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:55:21,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:21,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575081960] [2025-02-06 18:55:21,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575081960] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:55:21,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200394858] [2025-02-06 18:55:21,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:21,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:21,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:55:21,031 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:55:21,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 18:55:21,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 18:55:21,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:55:21,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:21,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:21,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-06 18:55:21,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:55:21,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 18:55:21,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:55:21,226 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:55:21,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 18:55:21,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 18:55:21,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 18:55:21,294 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 18:55:21,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-02-06 18:55:21,373 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-02-06 18:55:21,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-02-06 18:55:21,448 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:55:21,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:55:21,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:21,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2025-02-06 18:55:21,572 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_9 (Array Int Int))) (or (< (+ (select v_arrayElimArr_9 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648) 0) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_9) c_~A~0.base) (+ c_~A~0.offset 4)))))) is different from false [2025-02-06 18:55:21,580 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_9 (Array Int Int))) (or (< (+ (select v_arrayElimArr_9 4) 2147483648) 0) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_9) c_~A~0.base) (+ c_~A~0.offset 4)))))) is different from false [2025-02-06 18:55:21,597 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_207| Int) (v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (or (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_500) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_207| v_arrayElimArr_9) c_~A~0.base) (+ c_~A~0.offset 4)))) (< (+ (select v_arrayElimArr_9 4) 2147483648) 0))) is different from false [2025-02-06 18:55:21,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:21,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-02-06 18:55:21,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:21,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 75 [2025-02-06 18:55:21,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:55:21,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 67 [2025-02-06 18:55:21,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-02-06 18:55:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-02-06 18:55:21,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200394858] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:55:21,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:55:21,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 27 [2025-02-06 18:55:21,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225272202] [2025-02-06 18:55:21,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:55:21,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 18:55:21,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:21,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 18:55:21,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=562, Unknown=3, NotChecked=150, Total=812 [2025-02-06 18:55:21,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-02-06 18:55:21,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 148 transitions, 887 flow. Second operand has 29 states, 29 states have (on average 45.827586206896555) internal successors, (1329), 29 states have internal predecessors, (1329), 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-02-06 18:55:21,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:21,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-02-06 18:55:21,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:23,334 INFO L124 PetriNetUnfolderBase]: 5970/9906 cut-off events. [2025-02-06 18:55:23,334 INFO L125 PetriNetUnfolderBase]: For 10634/11475 co-relation queries the response was YES. [2025-02-06 18:55:23,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28026 conditions, 9906 events. 5970/9906 cut-off events. For 10634/11475 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 64314 event pairs, 3147 based on Foata normal form. 146/8910 useless extension candidates. Maximal degree in co-relation 27938. Up to 5276 conditions per place. [2025-02-06 18:55:23,390 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 153 selfloop transitions, 33 changer transitions 0/224 dead transitions. [2025-02-06 18:55:23,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 224 transitions, 1548 flow [2025-02-06 18:55:23,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 18:55:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 18:55:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 785 transitions. [2025-02-06 18:55:23,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4984126984126984 [2025-02-06 18:55:23,391 INFO L175 Difference]: Start difference. First operand has 173 places, 148 transitions, 887 flow. Second operand 15 states and 785 transitions. [2025-02-06 18:55:23,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 224 transitions, 1548 flow [2025-02-06 18:55:23,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 224 transitions, 1489 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-02-06 18:55:23,403 INFO L231 Difference]: Finished difference. Result has 177 places, 147 transitions, 890 flow [2025-02-06 18:55:23,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=890, PETRI_PLACES=177, PETRI_TRANSITIONS=147} [2025-02-06 18:55:23,403 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 77 predicate places. [2025-02-06 18:55:23,404 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 147 transitions, 890 flow [2025-02-06 18:55:23,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 45.827586206896555) internal successors, (1329), 29 states have internal predecessors, (1329), 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-02-06 18:55:23,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:23,404 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:23,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-06 18:55:23,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:23,609 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:23,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:23,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1194654496, now seen corresponding path program 2 times [2025-02-06 18:55:23,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:23,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237208784] [2025-02-06 18:55:23,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:55:23,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:23,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-06 18:55:23,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 18:55:23,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:55:23,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 18:55:23,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:23,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237208784] [2025-02-06 18:55:23,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237208784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:55:23,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:55:23,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:55:23,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015753623] [2025-02-06 18:55:23,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:55:23,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:55:23,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:23,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:55:23,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:55:23,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 105 [2025-02-06 18:55:23,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 147 transitions, 890 flow. Second operand has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 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-02-06 18:55:23,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:23,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 105 [2025-02-06 18:55:23,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:24,478 INFO L124 PetriNetUnfolderBase]: 6392/10098 cut-off events. [2025-02-06 18:55:24,479 INFO L125 PetriNetUnfolderBase]: For 10891/11669 co-relation queries the response was YES. [2025-02-06 18:55:24,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30119 conditions, 10098 events. 6392/10098 cut-off events. For 10891/11669 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 63889 event pairs, 1509 based on Foata normal form. 459/9262 useless extension candidates. Maximal degree in co-relation 30031. Up to 4260 conditions per place. [2025-02-06 18:55:24,529 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 147 selfloop transitions, 9 changer transitions 0/196 dead transitions. [2025-02-06 18:55:24,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 196 transitions, 1444 flow [2025-02-06 18:55:24,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:55:24,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:55:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 295 transitions. [2025-02-06 18:55:24,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2025-02-06 18:55:24,530 INFO L175 Difference]: Start difference. First operand has 177 places, 147 transitions, 890 flow. Second operand 4 states and 295 transitions. [2025-02-06 18:55:24,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 196 transitions, 1444 flow [2025-02-06 18:55:24,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 196 transitions, 1365 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-02-06 18:55:24,547 INFO L231 Difference]: Finished difference. Result has 166 places, 146 transitions, 839 flow [2025-02-06 18:55:24,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=839, PETRI_PLACES=166, PETRI_TRANSITIONS=146} [2025-02-06 18:55:24,548 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 66 predicate places. [2025-02-06 18:55:24,548 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 146 transitions, 839 flow [2025-02-06 18:55:24,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 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-02-06 18:55:24,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:24,549 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:24,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 18:55:24,549 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:24,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:24,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1124003822, now seen corresponding path program 1 times [2025-02-06 18:55:24,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:24,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549806986] [2025-02-06 18:55:24,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:24,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:24,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 18:55:24,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 18:55:24,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:24,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 18:55:24,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:24,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549806986] [2025-02-06 18:55:24,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549806986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:55:24,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:55:24,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:55:24,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981704604] [2025-02-06 18:55:24,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:55:24,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:55:24,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:24,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:55:24,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:55:24,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 105 [2025-02-06 18:55:24,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 146 transitions, 839 flow. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:55:24,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:24,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 105 [2025-02-06 18:55:24,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:25,286 INFO L124 PetriNetUnfolderBase]: 5890/9478 cut-off events. [2025-02-06 18:55:25,286 INFO L125 PetriNetUnfolderBase]: For 14761/15441 co-relation queries the response was YES. [2025-02-06 18:55:25,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29634 conditions, 9478 events. 5890/9478 cut-off events. For 14761/15441 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 59655 event pairs, 3737 based on Foata normal form. 455/9028 useless extension candidates. Maximal degree in co-relation 29546. Up to 6659 conditions per place. [2025-02-06 18:55:25,345 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 138 selfloop transitions, 6 changer transitions 0/183 dead transitions. [2025-02-06 18:55:25,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 183 transitions, 1305 flow [2025-02-06 18:55:25,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:55:25,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:55:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 287 transitions. [2025-02-06 18:55:25,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-02-06 18:55:25,346 INFO L175 Difference]: Start difference. First operand has 166 places, 146 transitions, 839 flow. Second operand 4 states and 287 transitions. [2025-02-06 18:55:25,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 183 transitions, 1305 flow [2025-02-06 18:55:25,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 183 transitions, 1255 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:55:25,359 INFO L231 Difference]: Finished difference. Result has 168 places, 147 transitions, 848 flow [2025-02-06 18:55:25,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=848, PETRI_PLACES=168, PETRI_TRANSITIONS=147} [2025-02-06 18:55:25,360 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 68 predicate places. [2025-02-06 18:55:25,360 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 147 transitions, 848 flow [2025-02-06 18:55:25,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:55:25,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:25,360 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:25,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 18:55:25,360 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:25,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:25,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1620415403, now seen corresponding path program 1 times [2025-02-06 18:55:25,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:25,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176175723] [2025-02-06 18:55:25,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:25,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:25,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 18:55:25,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 18:55:25,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:25,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 18:55:25,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:25,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176175723] [2025-02-06 18:55:25,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176175723] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:55:25,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889971637] [2025-02-06 18:55:25,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:25,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:25,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:55:25,442 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:55:25,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 18:55:25,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 18:55:25,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 18:55:25,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:25,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:25,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 18:55:25,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:55:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 18:55:25,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:55:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 18:55:25,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889971637] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:55:25,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:55:25,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 23 [2025-02-06 18:55:25,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540150068] [2025-02-06 18:55:25,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:55:25,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 18:55:25,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:25,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 18:55:25,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2025-02-06 18:55:26,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 105 [2025-02-06 18:55:26,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 147 transitions, 848 flow. Second operand has 23 states, 23 states have (on average 48.17391304347826) internal successors, (1108), 23 states have internal predecessors, (1108), 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-02-06 18:55:26,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:26,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 105 [2025-02-06 18:55:26,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:27,738 INFO L124 PetriNetUnfolderBase]: 9996/16304 cut-off events. [2025-02-06 18:55:27,738 INFO L125 PetriNetUnfolderBase]: For 20139/21363 co-relation queries the response was YES. [2025-02-06 18:55:27,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49772 conditions, 16304 events. 9996/16304 cut-off events. For 20139/21363 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 110996 event pairs, 3629 based on Foata normal form. 288/14482 useless extension candidates. Maximal degree in co-relation 49648. Up to 4652 conditions per place. [2025-02-06 18:55:27,834 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 285 selfloop transitions, 70 changer transitions 0/397 dead transitions. [2025-02-06 18:55:27,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 397 transitions, 2906 flow [2025-02-06 18:55:27,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 18:55:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 18:55:27,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1246 transitions. [2025-02-06 18:55:27,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5650793650793651 [2025-02-06 18:55:27,836 INFO L175 Difference]: Start difference. First operand has 168 places, 147 transitions, 848 flow. Second operand 21 states and 1246 transitions. [2025-02-06 18:55:27,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 397 transitions, 2906 flow [2025-02-06 18:55:27,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 397 transitions, 2875 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:55:27,878 INFO L231 Difference]: Finished difference. Result has 192 places, 177 transitions, 1265 flow [2025-02-06 18:55:27,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1265, PETRI_PLACES=192, PETRI_TRANSITIONS=177} [2025-02-06 18:55:27,878 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 92 predicate places. [2025-02-06 18:55:27,878 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 177 transitions, 1265 flow [2025-02-06 18:55:27,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 48.17391304347826) internal successors, (1108), 23 states have internal predecessors, (1108), 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-02-06 18:55:27,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:27,879 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:27,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-06 18:55:28,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:28,080 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:28,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:28,080 INFO L85 PathProgramCache]: Analyzing trace with hash -355097955, now seen corresponding path program 1 times [2025-02-06 18:55:28,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:28,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251987705] [2025-02-06 18:55:28,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:28,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:28,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 18:55:28,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 18:55:28,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:28,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:28,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:55:28,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:28,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251987705] [2025-02-06 18:55:28,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251987705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:55:28,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:55:28,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:55:28,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148906093] [2025-02-06 18:55:28,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:55:28,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:55:28,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:28,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:55:28,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:55:28,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 105 [2025-02-06 18:55:28,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 177 transitions, 1265 flow. Second operand has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 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-02-06 18:55:28,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:28,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 105 [2025-02-06 18:55:28,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:30,196 INFO L124 PetriNetUnfolderBase]: 13287/21927 cut-off events. [2025-02-06 18:55:30,196 INFO L125 PetriNetUnfolderBase]: For 38996/40656 co-relation queries the response was YES. [2025-02-06 18:55:30,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74647 conditions, 21927 events. 13287/21927 cut-off events. For 38996/40656 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 159281 event pairs, 5618 based on Foata normal form. 448/20567 useless extension candidates. Maximal degree in co-relation 74511. Up to 13387 conditions per place. [2025-02-06 18:55:30,370 INFO L140 encePairwiseOnDemand]: 94/105 looper letters, 165 selfloop transitions, 16 changer transitions 0/219 dead transitions. [2025-02-06 18:55:30,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 219 transitions, 1861 flow [2025-02-06 18:55:30,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:55:30,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:55:30,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 309 transitions. [2025-02-06 18:55:30,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5885714285714285 [2025-02-06 18:55:30,371 INFO L175 Difference]: Start difference. First operand has 192 places, 177 transitions, 1265 flow. Second operand 5 states and 309 transitions. [2025-02-06 18:55:30,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 219 transitions, 1861 flow [2025-02-06 18:55:30,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 219 transitions, 1808 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-02-06 18:55:30,762 INFO L231 Difference]: Finished difference. Result has 195 places, 181 transitions, 1315 flow [2025-02-06 18:55:30,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1315, PETRI_PLACES=195, PETRI_TRANSITIONS=181} [2025-02-06 18:55:30,763 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 95 predicate places. [2025-02-06 18:55:30,763 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 181 transitions, 1315 flow [2025-02-06 18:55:30,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 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-02-06 18:55:30,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:30,763 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:30,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 18:55:30,764 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:30,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:30,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1631924389, now seen corresponding path program 1 times [2025-02-06 18:55:30,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:30,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942916515] [2025-02-06 18:55:30,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:30,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:30,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 18:55:30,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 18:55:30,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:30,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 18:55:30,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:30,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942916515] [2025-02-06 18:55:30,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942916515] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:55:30,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867818688] [2025-02-06 18:55:30,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:30,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:30,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:55:30,968 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:55:30,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-06 18:55:31,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 18:55:31,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 18:55:31,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:31,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:31,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 18:55:31,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:55:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 18:55:31,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:55:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 18:55:31,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867818688] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:55:31,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:55:31,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-02-06 18:55:31,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144231008] [2025-02-06 18:55:31,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:55:31,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 18:55:31,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:31,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 18:55:31,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2025-02-06 18:55:31,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 105 [2025-02-06 18:55:31,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 181 transitions, 1315 flow. Second operand has 26 states, 26 states have (on average 45.84615384615385) internal successors, (1192), 26 states have internal predecessors, (1192), 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-02-06 18:55:31,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:31,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 105 [2025-02-06 18:55:31,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:34,302 INFO L124 PetriNetUnfolderBase]: 16357/26332 cut-off events. [2025-02-06 18:55:34,302 INFO L125 PetriNetUnfolderBase]: For 41698/42958 co-relation queries the response was YES. [2025-02-06 18:55:34,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82816 conditions, 26332 events. 16357/26332 cut-off events. For 41698/42958 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 185299 event pairs, 11141 based on Foata normal form. 575/25283 useless extension candidates. Maximal degree in co-relation 82638. Up to 17163 conditions per place. [2025-02-06 18:55:34,510 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 164 selfloop transitions, 75 changer transitions 0/277 dead transitions. [2025-02-06 18:55:34,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 277 transitions, 2308 flow [2025-02-06 18:55:34,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 18:55:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-06 18:55:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 911 transitions. [2025-02-06 18:55:34,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5103641456582633 [2025-02-06 18:55:34,512 INFO L175 Difference]: Start difference. First operand has 195 places, 181 transitions, 1315 flow. Second operand 17 states and 911 transitions. [2025-02-06 18:55:34,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 277 transitions, 2308 flow [2025-02-06 18:55:34,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 277 transitions, 2300 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:55:34,575 INFO L231 Difference]: Finished difference. Result has 215 places, 190 transitions, 1612 flow [2025-02-06 18:55:34,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1612, PETRI_PLACES=215, PETRI_TRANSITIONS=190} [2025-02-06 18:55:34,576 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 115 predicate places. [2025-02-06 18:55:34,576 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 190 transitions, 1612 flow [2025-02-06 18:55:34,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 45.84615384615385) internal successors, (1192), 26 states have internal predecessors, (1192), 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-02-06 18:55:34,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:34,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:34,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-06 18:55:34,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:34,781 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:34,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:34,782 INFO L85 PathProgramCache]: Analyzing trace with hash 937792205, now seen corresponding path program 1 times [2025-02-06 18:55:34,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:34,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846809964] [2025-02-06 18:55:34,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:34,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:34,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 18:55:34,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 18:55:34,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:34,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:55:34,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:34,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846809964] [2025-02-06 18:55:34,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846809964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:55:34,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:55:34,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:55:34,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46972021] [2025-02-06 18:55:34,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:55:34,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:55:34,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:34,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:55:34,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:55:34,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-02-06 18:55:34,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 190 transitions, 1612 flow. Second operand has 7 states, 7 states have (on average 46.714285714285715) internal successors, (327), 7 states have internal predecessors, (327), 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-02-06 18:55:34,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:34,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-02-06 18:55:34,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:38,806 INFO L124 PetriNetUnfolderBase]: 20154/34513 cut-off events. [2025-02-06 18:55:38,806 INFO L125 PetriNetUnfolderBase]: For 72550/75517 co-relation queries the response was YES. [2025-02-06 18:55:38,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117964 conditions, 34513 events. 20154/34513 cut-off events. For 72550/75517 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 281704 event pairs, 16652 based on Foata normal form. 732/32807 useless extension candidates. Maximal degree in co-relation 117744. Up to 15911 conditions per place. [2025-02-06 18:55:39,051 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 191 selfloop transitions, 26 changer transitions 0/253 dead transitions. [2025-02-06 18:55:39,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 253 transitions, 2440 flow [2025-02-06 18:55:39,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:55:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:55:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 345 transitions. [2025-02-06 18:55:39,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-02-06 18:55:39,053 INFO L175 Difference]: Start difference. First operand has 215 places, 190 transitions, 1612 flow. Second operand 6 states and 345 transitions. [2025-02-06 18:55:39,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 253 transitions, 2440 flow [2025-02-06 18:55:39,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 253 transitions, 2240 flow, removed 12 selfloop flow, removed 13 redundant places. [2025-02-06 18:55:39,270 INFO L231 Difference]: Finished difference. Result has 210 places, 198 transitions, 1564 flow [2025-02-06 18:55:39,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1564, PETRI_PLACES=210, PETRI_TRANSITIONS=198} [2025-02-06 18:55:39,270 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 110 predicate places. [2025-02-06 18:55:39,270 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 198 transitions, 1564 flow [2025-02-06 18:55:39,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.714285714285715) internal successors, (327), 7 states have internal predecessors, (327), 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-02-06 18:55:39,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:39,271 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:39,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 18:55:39,271 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:39,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1437566766, now seen corresponding path program 1 times [2025-02-06 18:55:39,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:39,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994474706] [2025-02-06 18:55:39,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:39,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:39,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 18:55:39,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 18:55:39,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:39,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 18:55:39,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:39,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994474706] [2025-02-06 18:55:39,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994474706] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:55:39,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805035897] [2025-02-06 18:55:39,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:39,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:55:39,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:55:39,370 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:55:39,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 18:55:39,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 18:55:39,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 18:55:39,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:39,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:39,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 18:55:39,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:55:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 18:55:39,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:55:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 18:55:39,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805035897] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:55:39,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:55:39,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-02-06 18:55:39,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617614065] [2025-02-06 18:55:39,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:55:39,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 18:55:39,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:39,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 18:55:39,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-02-06 18:55:39,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 105 [2025-02-06 18:55:39,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 198 transitions, 1564 flow. Second operand has 15 states, 15 states have (on average 49.4) internal successors, (741), 15 states have internal predecessors, (741), 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-02-06 18:55:39,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:39,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 105 [2025-02-06 18:55:39,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:44,139 INFO L124 PetriNetUnfolderBase]: 23398/38700 cut-off events. [2025-02-06 18:55:44,139 INFO L125 PetriNetUnfolderBase]: For 87043/90699 co-relation queries the response was YES. [2025-02-06 18:55:44,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129881 conditions, 38700 events. 23398/38700 cut-off events. For 87043/90699 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 307014 event pairs, 15716 based on Foata normal form. 884/35021 useless extension candidates. Maximal degree in co-relation 129652. Up to 26541 conditions per place. [2025-02-06 18:55:44,543 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 167 selfloop transitions, 64 changer transitions 0/277 dead transitions. [2025-02-06 18:55:44,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 277 transitions, 2569 flow [2025-02-06 18:55:44,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 18:55:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 18:55:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 682 transitions. [2025-02-06 18:55:44,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5412698412698412 [2025-02-06 18:55:44,545 INFO L175 Difference]: Start difference. First operand has 210 places, 198 transitions, 1564 flow. Second operand 12 states and 682 transitions. [2025-02-06 18:55:44,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 277 transitions, 2569 flow [2025-02-06 18:55:44,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 277 transitions, 2556 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:55:44,742 INFO L231 Difference]: Finished difference. Result has 223 places, 200 transitions, 1744 flow [2025-02-06 18:55:44,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1744, PETRI_PLACES=223, PETRI_TRANSITIONS=200} [2025-02-06 18:55:44,744 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 123 predicate places. [2025-02-06 18:55:44,744 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 200 transitions, 1744 flow [2025-02-06 18:55:44,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 49.4) internal successors, (741), 15 states have internal predecessors, (741), 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-02-06 18:55:44,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:44,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:44,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-02-06 18:55:44,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-06 18:55:44,945 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:44,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:44,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1342366493, now seen corresponding path program 1 times [2025-02-06 18:55:44,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:44,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404053136] [2025-02-06 18:55:44,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:44,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:44,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 18:55:44,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 18:55:44,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:44,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:55:45,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:45,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404053136] [2025-02-06 18:55:45,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404053136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:55:45,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:55:45,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:55:45,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639987007] [2025-02-06 18:55:45,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:55:45,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:55:45,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:45,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:55:45,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:55:45,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-02-06 18:55:45,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 200 transitions, 1744 flow. Second operand has 6 states, 6 states have (on average 53.166666666666664) internal successors, (319), 6 states have internal predecessors, (319), 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-02-06 18:55:45,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:45,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-02-06 18:55:45,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:49,280 INFO L124 PetriNetUnfolderBase]: 20426/35284 cut-off events. [2025-02-06 18:55:49,281 INFO L125 PetriNetUnfolderBase]: For 79216/82438 co-relation queries the response was YES. [2025-02-06 18:55:49,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121312 conditions, 35284 events. 20426/35284 cut-off events. For 79216/82438 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 297401 event pairs, 16658 based on Foata normal form. 845/33216 useless extension candidates. Maximal degree in co-relation 121050. Up to 20560 conditions per place. [2025-02-06 18:55:49,560 INFO L140 encePairwiseOnDemand]: 94/105 looper letters, 182 selfloop transitions, 27 changer transitions 0/253 dead transitions. [2025-02-06 18:55:49,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 253 transitions, 2503 flow [2025-02-06 18:55:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:55:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:55:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 327 transitions. [2025-02-06 18:55:49,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6228571428571429 [2025-02-06 18:55:49,564 INFO L175 Difference]: Start difference. First operand has 223 places, 200 transitions, 1744 flow. Second operand 5 states and 327 transitions. [2025-02-06 18:55:49,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 253 transitions, 2503 flow [2025-02-06 18:55:49,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 253 transitions, 2429 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 18:55:49,735 INFO L231 Difference]: Finished difference. Result has 224 places, 208 transitions, 1840 flow [2025-02-06 18:55:49,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1670, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1840, PETRI_PLACES=224, PETRI_TRANSITIONS=208} [2025-02-06 18:55:49,736 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 124 predicate places. [2025-02-06 18:55:49,736 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 208 transitions, 1840 flow [2025-02-06 18:55:49,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 53.166666666666664) internal successors, (319), 6 states have internal predecessors, (319), 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-02-06 18:55:49,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:49,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:49,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 18:55:49,737 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:49,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:49,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1013599772, now seen corresponding path program 1 times [2025-02-06 18:55:49,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:49,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997935965] [2025-02-06 18:55:49,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:49,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:49,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 18:55:49,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 18:55:49,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:49,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:49,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:55:49,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:49,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997935965] [2025-02-06 18:55:49,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997935965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:55:49,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:55:49,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 18:55:49,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789764628] [2025-02-06 18:55:49,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:55:49,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 18:55:49,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:49,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 18:55:49,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 18:55:50,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 105 [2025-02-06 18:55:50,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 208 transitions, 1840 flow. Second operand has 9 states, 9 states have (on average 36.111111111111114) internal successors, (325), 9 states have internal predecessors, (325), 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-02-06 18:55:50,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:50,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 105 [2025-02-06 18:55:50,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:53,997 INFO L124 PetriNetUnfolderBase]: 20405/35202 cut-off events. [2025-02-06 18:55:53,998 INFO L125 PetriNetUnfolderBase]: For 84054/87568 co-relation queries the response was YES. [2025-02-06 18:55:54,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122977 conditions, 35202 events. 20405/35202 cut-off events. For 84054/87568 co-relation queries the response was YES. Maximal size of possible extension queue 1146. Compared 297097 event pairs, 12037 based on Foata normal form. 902/33514 useless extension candidates. Maximal degree in co-relation 122628. Up to 20560 conditions per place. [2025-02-06 18:55:54,312 INFO L140 encePairwiseOnDemand]: 87/105 looper letters, 186 selfloop transitions, 49 changer transitions 6/266 dead transitions. [2025-02-06 18:55:54,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 266 transitions, 2680 flow [2025-02-06 18:55:54,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:55:54,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 18:55:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 564 transitions. [2025-02-06 18:55:54,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3836734693877551 [2025-02-06 18:55:54,314 INFO L175 Difference]: Start difference. First operand has 224 places, 208 transitions, 1840 flow. Second operand 14 states and 564 transitions. [2025-02-06 18:55:54,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 266 transitions, 2680 flow [2025-02-06 18:55:54,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 266 transitions, 2680 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:55:54,470 INFO L231 Difference]: Finished difference. Result has 242 places, 217 transitions, 2046 flow [2025-02-06 18:55:54,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1840, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2046, PETRI_PLACES=242, PETRI_TRANSITIONS=217} [2025-02-06 18:55:54,471 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 142 predicate places. [2025-02-06 18:55:54,471 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 217 transitions, 2046 flow [2025-02-06 18:55:54,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.111111111111114) internal successors, (325), 9 states have internal predecessors, (325), 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-02-06 18:55:54,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:54,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:54,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 18:55:54,471 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:54,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:54,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2009849058, now seen corresponding path program 1 times [2025-02-06 18:55:54,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:54,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582413292] [2025-02-06 18:55:54,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:54,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:54,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 18:55:54,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 18:55:54,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:54,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:55:54,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:54,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582413292] [2025-02-06 18:55:54,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582413292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:55:54,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:55:54,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:55:54,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474253634] [2025-02-06 18:55:54,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:55:54,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:55:54,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:54,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:55:54,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:55:54,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 105 [2025-02-06 18:55:54,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 217 transitions, 2046 flow. Second operand has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 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-02-06 18:55:54,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:55:54,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 105 [2025-02-06 18:55:54,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:55:59,202 INFO L124 PetriNetUnfolderBase]: 20382/35324 cut-off events. [2025-02-06 18:55:59,202 INFO L125 PetriNetUnfolderBase]: For 89019/92290 co-relation queries the response was YES. [2025-02-06 18:55:59,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124457 conditions, 35324 events. 20382/35324 cut-off events. For 89019/92290 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 299381 event pairs, 17000 based on Foata normal form. 859/33308 useless extension candidates. Maximal degree in co-relation 124139. Up to 16433 conditions per place. [2025-02-06 18:55:59,588 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 201 selfloop transitions, 19 changer transitions 0/270 dead transitions. [2025-02-06 18:55:59,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 270 transitions, 2812 flow [2025-02-06 18:55:59,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:55:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:55:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 308 transitions. [2025-02-06 18:55:59,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2025-02-06 18:55:59,590 INFO L175 Difference]: Start difference. First operand has 242 places, 217 transitions, 2046 flow. Second operand 5 states and 308 transitions. [2025-02-06 18:55:59,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 270 transitions, 2812 flow [2025-02-06 18:55:59,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 270 transitions, 2779 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-02-06 18:55:59,738 INFO L231 Difference]: Finished difference. Result has 243 places, 216 transitions, 2056 flow [2025-02-06 18:55:59,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1999, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2056, PETRI_PLACES=243, PETRI_TRANSITIONS=216} [2025-02-06 18:55:59,738 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 143 predicate places. [2025-02-06 18:55:59,739 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 216 transitions, 2056 flow [2025-02-06 18:55:59,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 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-02-06 18:55:59,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:55:59,739 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:55:59,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 18:55:59,739 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:55:59,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:55:59,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1356822640, now seen corresponding path program 1 times [2025-02-06 18:55:59,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:55:59,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673406958] [2025-02-06 18:55:59,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:55:59,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:55:59,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 18:55:59,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 18:55:59,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:55:59,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:55:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:55:59,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:55:59,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673406958] [2025-02-06 18:55:59,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673406958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:55:59,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:55:59,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:55:59,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030354209] [2025-02-06 18:55:59,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:55:59,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:55:59,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:55:59,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:55:59,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:56:00,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 105 [2025-02-06 18:56:00,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 216 transitions, 2056 flow. Second operand has 8 states, 8 states have (on average 38.5) internal successors, (308), 8 states have internal predecessors, (308), 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-02-06 18:56:00,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:00,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 105 [2025-02-06 18:56:00,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:05,454 INFO L124 PetriNetUnfolderBase]: 25910/44450 cut-off events. [2025-02-06 18:56:05,455 INFO L125 PetriNetUnfolderBase]: For 108416/113027 co-relation queries the response was YES. [2025-02-06 18:56:05,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155692 conditions, 44450 events. 25910/44450 cut-off events. For 108416/113027 co-relation queries the response was YES. Maximal size of possible extension queue 1459. Compared 389009 event pairs, 21963 based on Foata normal form. 1144/41912 useless extension candidates. Maximal degree in co-relation 155395. Up to 24268 conditions per place. [2025-02-06 18:56:05,923 INFO L140 encePairwiseOnDemand]: 88/105 looper letters, 206 selfloop transitions, 35 changer transitions 15/288 dead transitions. [2025-02-06 18:56:05,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 288 transitions, 3070 flow [2025-02-06 18:56:05,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:56:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 18:56:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 591 transitions. [2025-02-06 18:56:05,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4020408163265306 [2025-02-06 18:56:05,925 INFO L175 Difference]: Start difference. First operand has 243 places, 216 transitions, 2056 flow. Second operand 14 states and 591 transitions. [2025-02-06 18:56:05,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 288 transitions, 3070 flow [2025-02-06 18:56:06,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 288 transitions, 3059 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:56:06,145 INFO L231 Difference]: Finished difference. Result has 262 places, 218 transitions, 2189 flow [2025-02-06 18:56:06,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2189, PETRI_PLACES=262, PETRI_TRANSITIONS=218} [2025-02-06 18:56:06,146 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 162 predicate places. [2025-02-06 18:56:06,146 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 218 transitions, 2189 flow [2025-02-06 18:56:06,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.5) internal successors, (308), 8 states have internal predecessors, (308), 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-02-06 18:56:06,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:06,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:06,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 18:56:06,146 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:56:06,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:06,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2119188339, now seen corresponding path program 1 times [2025-02-06 18:56:06,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:06,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400811838] [2025-02-06 18:56:06,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:06,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:06,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 18:56:06,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 18:56:06,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:06,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:56:06,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:06,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400811838] [2025-02-06 18:56:06,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400811838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:06,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:06,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 18:56:06,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452955623] [2025-02-06 18:56:06,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:06,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:56:06,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:06,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:56:06,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:56:06,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-02-06 18:56:06,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 218 transitions, 2189 flow. Second operand has 8 states, 8 states have (on average 46.25) internal successors, (370), 8 states have internal predecessors, (370), 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-02-06 18:56:06,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:06,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-02-06 18:56:06,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:12,480 INFO L124 PetriNetUnfolderBase]: 25914/44276 cut-off events. [2025-02-06 18:56:12,481 INFO L125 PetriNetUnfolderBase]: For 109054/113597 co-relation queries the response was YES. [2025-02-06 18:56:12,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155135 conditions, 44276 events. 25914/44276 cut-off events. For 109054/113597 co-relation queries the response was YES. Maximal size of possible extension queue 1462. Compared 385548 event pairs, 21621 based on Foata normal form. 1090/41627 useless extension candidates. Maximal degree in co-relation 155023. Up to 32383 conditions per place. [2025-02-06 18:56:13,026 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 181 selfloop transitions, 37 changer transitions 0/262 dead transitions. [2025-02-06 18:56:13,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 262 transitions, 2915 flow [2025-02-06 18:56:13,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:56:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 18:56:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 381 transitions. [2025-02-06 18:56:13,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2025-02-06 18:56:13,028 INFO L175 Difference]: Start difference. First operand has 262 places, 218 transitions, 2189 flow. Second operand 7 states and 381 transitions. [2025-02-06 18:56:13,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 262 transitions, 2915 flow [2025-02-06 18:56:13,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 262 transitions, 2886 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-02-06 18:56:13,250 INFO L231 Difference]: Finished difference. Result has 263 places, 220 transitions, 2286 flow [2025-02-06 18:56:13,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2160, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2286, PETRI_PLACES=263, PETRI_TRANSITIONS=220} [2025-02-06 18:56:13,251 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 163 predicate places. [2025-02-06 18:56:13,251 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 220 transitions, 2286 flow [2025-02-06 18:56:13,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 46.25) internal successors, (370), 8 states have internal predecessors, (370), 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-02-06 18:56:13,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:13,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:13,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 18:56:13,252 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:56:13,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:13,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1518760230, now seen corresponding path program 1 times [2025-02-06 18:56:13,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:13,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381331725] [2025-02-06 18:56:13,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:13,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:13,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 18:56:13,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 18:56:13,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:13,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:56:13,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:13,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381331725] [2025-02-06 18:56:13,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381331725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:13,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:13,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:56:13,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552326183] [2025-02-06 18:56:13,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:13,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:56:13,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:13,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:56:13,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:56:13,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-02-06 18:56:13,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 220 transitions, 2286 flow. Second operand has 6 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 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-02-06 18:56:13,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:13,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-02-06 18:56:13,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:19,134 INFO L124 PetriNetUnfolderBase]: 25894/44140 cut-off events. [2025-02-06 18:56:19,134 INFO L125 PetriNetUnfolderBase]: For 111246/115853 co-relation queries the response was YES. [2025-02-06 18:56:19,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155045 conditions, 44140 events. 25894/44140 cut-off events. For 111246/115853 co-relation queries the response was YES. Maximal size of possible extension queue 1462. Compared 383398 event pairs, 21963 based on Foata normal form. 1115/41569 useless extension candidates. Maximal degree in co-relation 154762. Up to 24340 conditions per place. [2025-02-06 18:56:19,554 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 197 selfloop transitions, 22 changer transitions 1/262 dead transitions. [2025-02-06 18:56:19,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 262 transitions, 2946 flow [2025-02-06 18:56:19,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:56:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:56:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 341 transitions. [2025-02-06 18:56:19,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5412698412698412 [2025-02-06 18:56:19,555 INFO L175 Difference]: Start difference. First operand has 263 places, 220 transitions, 2286 flow. Second operand 6 states and 341 transitions. [2025-02-06 18:56:19,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 262 transitions, 2946 flow [2025-02-06 18:56:19,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 262 transitions, 2827 flow, removed 5 selfloop flow, removed 11 redundant places. [2025-02-06 18:56:19,763 INFO L231 Difference]: Finished difference. Result has 257 places, 210 transitions, 2124 flow [2025-02-06 18:56:19,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2062, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2124, PETRI_PLACES=257, PETRI_TRANSITIONS=210} [2025-02-06 18:56:19,764 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 157 predicate places. [2025-02-06 18:56:19,764 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 210 transitions, 2124 flow [2025-02-06 18:56:19,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 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-02-06 18:56:19,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:19,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:19,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 18:56:19,764 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-02-06 18:56:19,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:19,765 INFO L85 PathProgramCache]: Analyzing trace with hash -724940954, now seen corresponding path program 1 times [2025-02-06 18:56:19,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:19,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884900216] [2025-02-06 18:56:19,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:19,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:19,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 18:56:19,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 18:56:19,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:19,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:56:19,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:19,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884900216] [2025-02-06 18:56:19,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884900216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:19,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:19,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:56:19,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177978947] [2025-02-06 18:56:19,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:19,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:56:19,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:19,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:56:19,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:56:19,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-02-06 18:56:19,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 210 transitions, 2124 flow. Second operand has 6 states, 6 states have (on average 53.833333333333336) internal successors, (323), 6 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:56:19,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:19,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-02-06 18:56:19,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand