./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-node-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-node-subst.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 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:50:06,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:50:06,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:50:06,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:50:06,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:50:06,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:50:06,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:50:06,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:50:06,602 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:50:06,602 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:50:06,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:50:06,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:50:06,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:50:06,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:50:06,603 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:50:06,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:50:06,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:50:06,604 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:50:06,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:50:06,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:50:06,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:50:06,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:50:06,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:50:06,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:50:06,604 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:50:06,604 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:50:06,604 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:50:06,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:50:06,604 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:50:06,605 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:50:06,605 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:50:06,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:50:06,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:50:06,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:50:06,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:50:06,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:50:06,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:50:06,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:50:06,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:50:06,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:50:06,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:50:06,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:50:06,606 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:50:06,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:50:06,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:50:06,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:50:06,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:50:06,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:50:06,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:50:06,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:50:06,606 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 -> 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 [2025-01-10 06:50:06,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:50:06,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:50:06,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:50:06,862 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:50:06,862 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:50:06,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-01-10 06:50:08,091 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8755d9679/7224fb70eb0a44eea9c80de84f7ef6be/FLAG648622531 [2025-01-10 06:50:08,356 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:50:08,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-01-10 06:50:08,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8755d9679/7224fb70eb0a44eea9c80de84f7ef6be/FLAG648622531 [2025-01-10 06:50:08,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8755d9679/7224fb70eb0a44eea9c80de84f7ef6be [2025-01-10 06:50:08,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:50:08,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:50:08,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:50:08,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:50:08,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:50:08,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:50:08" (1/1) ... [2025-01-10 06:50:08,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373f1443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:08, skipping insertion in model container [2025-01-10 06:50:08,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:50:08" (1/1) ... [2025-01-10 06:50:08,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:50:08,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:50:08,836 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:50:08,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:50:08,873 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:50:08,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:08 WrapperNode [2025-01-10 06:50:08,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:50:08,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:50:08,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:50:08,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:50:08,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:08" (1/1) ... [2025-01-10 06:50:08,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:08" (1/1) ... [2025-01-10 06:50:08,905 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 474 [2025-01-10 06:50:08,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:50:08,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:50:08,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:50:08,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:50:08,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:08" (1/1) ... [2025-01-10 06:50:08,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:08" (1/1) ... [2025-01-10 06:50:08,917 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:08" (1/1) ... [2025-01-10 06:50:08,942 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 15, 9]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-01-10 06:50:08,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:08" (1/1) ... [2025-01-10 06:50:08,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:08" (1/1) ... [2025-01-10 06:50:08,957 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:08" (1/1) ... [2025-01-10 06:50:08,961 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:08" (1/1) ... [2025-01-10 06:50:08,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:08" (1/1) ... [2025-01-10 06:50:08,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:08" (1/1) ... [2025-01-10 06:50:08,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:08" (1/1) ... [2025-01-10 06:50:08,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:50:08,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:50:08,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:50:08,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:50:08,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:08" (1/1) ... [2025-01-10 06:50:08,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:50:08,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:09,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:50:09,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:50:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:50:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:50:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:50:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:50:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:50:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:50:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:50:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:50:09,039 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:50:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:50:09,040 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:50:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:50:09,040 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:50:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:50:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:50:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:50:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:50:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:50:09,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:50:09,042 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:50:09,133 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:50:09,134 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:50:09,663 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:50:09,664 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:50:09,991 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:50:09,993 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:50:09,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:50:09 BoogieIcfgContainer [2025-01-10 06:50:09,993 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:50:09,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:50:09,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:50:09,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:50:09,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:50:08" (1/3) ... [2025-01-10 06:50:09,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450ed8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:50:09, skipping insertion in model container [2025-01-10 06:50:10,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:08" (2/3) ... [2025-01-10 06:50:10,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450ed8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:50:10, skipping insertion in model container [2025-01-10 06:50:10,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:50:09" (3/3) ... [2025-01-10 06:50:10,001 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2025-01-10 06:50:10,014 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:50:10,015 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-subst.wvr.c that has 4 procedures, 126 locations, 1 initial locations, 6 loop locations, and 42 error locations. [2025-01-10 06:50:10,015 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:50:10,112 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:50:10,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 140 transitions, 301 flow [2025-01-10 06:50:10,190 INFO L124 PetriNetUnfolderBase]: 15/137 cut-off events. [2025-01-10 06:50:10,193 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:50:10,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 15/137 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 389 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2025-01-10 06:50:10,197 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 140 transitions, 301 flow [2025-01-10 06:50:10,202 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 135 transitions, 285 flow [2025-01-10 06:50:10,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:50:10,221 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;@2d5522fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:50:10,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2025-01-10 06:50:10,223 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:50:10,223 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-01-10 06:50:10,223 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:50:10,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:10,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 06:50:10,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:10,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:10,227 INFO L85 PathProgramCache]: Analyzing trace with hash 45670, now seen corresponding path program 1 times [2025-01-10 06:50:10,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:10,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237134654] [2025-01-10 06:50:10,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:10,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:10,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:50:10,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:50:10,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:10,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:10,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:10,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237134654] [2025-01-10 06:50:10,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237134654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:10,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:10,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:10,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296084512] [2025-01-10 06:50:10,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:10,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:10,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:10,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:10,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:10,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:10,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 135 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 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-01-10 06:50:10,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:10,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:10,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:11,351 INFO L124 PetriNetUnfolderBase]: 4133/8026 cut-off events. [2025-01-10 06:50:11,352 INFO L125 PetriNetUnfolderBase]: For 253/253 co-relation queries the response was YES. [2025-01-10 06:50:11,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13743 conditions, 8026 events. 4133/8026 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 65938 event pairs, 2732 based on Foata normal form. 2/6384 useless extension candidates. Maximal degree in co-relation 13014. Up to 5498 conditions per place. [2025-01-10 06:50:11,411 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 61 selfloop transitions, 1 changer transitions 0/133 dead transitions. [2025-01-10 06:50:11,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 133 transitions, 405 flow [2025-01-10 06:50:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-01-10 06:50:11,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2025-01-10 06:50:11,423 INFO L175 Difference]: Start difference. First operand has 130 places, 135 transitions, 285 flow. Second operand 3 states and 286 transitions. [2025-01-10 06:50:11,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 133 transitions, 405 flow [2025-01-10 06:50:11,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 133 transitions, 396 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:50:11,433 INFO L231 Difference]: Finished difference. Result has 125 places, 133 transitions, 274 flow [2025-01-10 06:50:11,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=125, PETRI_TRANSITIONS=133} [2025-01-10 06:50:11,437 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -5 predicate places. [2025-01-10 06:50:11,438 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 133 transitions, 274 flow [2025-01-10 06:50:11,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 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-01-10 06:50:11,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:11,438 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:50:11,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:50:11,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:11,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:11,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1417280, now seen corresponding path program 1 times [2025-01-10 06:50:11,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:11,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650441398] [2025-01-10 06:50:11,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:11,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:11,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:50:11,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:50:11,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:11,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:11,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:11,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650441398] [2025-01-10 06:50:11,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650441398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:11,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:11,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:11,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385522694] [2025-01-10 06:50:11,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:11,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:11,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:11,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:11,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:11,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:11,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 133 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 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-01-10 06:50:11,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:11,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:11,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:12,230 INFO L124 PetriNetUnfolderBase]: 4133/8024 cut-off events. [2025-01-10 06:50:12,231 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-01-10 06:50:12,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13658 conditions, 8024 events. 4133/8024 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66075 event pairs, 2732 based on Foata normal form. 0/6382 useless extension candidates. Maximal degree in co-relation 13652. Up to 5496 conditions per place. [2025-01-10 06:50:12,260 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 59 selfloop transitions, 1 changer transitions 0/131 dead transitions. [2025-01-10 06:50:12,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 131 transitions, 390 flow [2025-01-10 06:50:12,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-01-10 06:50:12,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-01-10 06:50:12,262 INFO L175 Difference]: Start difference. First operand has 125 places, 133 transitions, 274 flow. Second operand 3 states and 284 transitions. [2025-01-10 06:50:12,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 131 transitions, 390 flow [2025-01-10 06:50:12,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 131 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:12,264 INFO L231 Difference]: Finished difference. Result has 124 places, 131 transitions, 271 flow [2025-01-10 06:50:12,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=124, PETRI_TRANSITIONS=131} [2025-01-10 06:50:12,265 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -6 predicate places. [2025-01-10 06:50:12,265 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 131 transitions, 271 flow [2025-01-10 06:50:12,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 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-01-10 06:50:12,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:12,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:50:12,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:50:12,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:12,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:12,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1362052593, now seen corresponding path program 1 times [2025-01-10 06:50:12,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:12,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8826070] [2025-01-10 06:50:12,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:12,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:12,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:50:12,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:50:12,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:12,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:12,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:12,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8826070] [2025-01-10 06:50:12,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8826070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:12,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:12,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:12,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671499279] [2025-01-10 06:50:12,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:12,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:12,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:12,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:12,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:12,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 06:50:12,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 131 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:12,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:12,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 06:50:12,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:12,949 INFO L124 PetriNetUnfolderBase]: 4136/8036 cut-off events. [2025-01-10 06:50:12,949 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-01-10 06:50:12,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13686 conditions, 8036 events. 4136/8036 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66123 event pairs, 2732 based on Foata normal form. 3/6394 useless extension candidates. Maximal degree in co-relation 13679. Up to 5506 conditions per place. [2025-01-10 06:50:12,980 INFO L140 encePairwiseOnDemand]: 122/140 looper letters, 63 selfloop transitions, 12 changer transitions 0/140 dead transitions. [2025-01-10 06:50:12,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 140 transitions, 439 flow [2025-01-10 06:50:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2025-01-10 06:50:12,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6589285714285714 [2025-01-10 06:50:12,983 INFO L175 Difference]: Start difference. First operand has 124 places, 131 transitions, 271 flow. Second operand 4 states and 369 transitions. [2025-01-10 06:50:12,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 140 transitions, 439 flow [2025-01-10 06:50:12,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 140 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:12,985 INFO L231 Difference]: Finished difference. Result has 128 places, 140 transitions, 357 flow [2025-01-10 06:50:12,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=357, PETRI_PLACES=128, PETRI_TRANSITIONS=140} [2025-01-10 06:50:12,986 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -2 predicate places. [2025-01-10 06:50:12,986 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 140 transitions, 357 flow [2025-01-10 06:50:12,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:12,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:12,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:50:12,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:50:12,986 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:12,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:12,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1362052643, now seen corresponding path program 1 times [2025-01-10 06:50:12,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:12,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429085961] [2025-01-10 06:50:12,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:12,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:12,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:50:12,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:50:12,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:12,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:13,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:13,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429085961] [2025-01-10 06:50:13,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429085961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:13,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:13,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:13,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079133870] [2025-01-10 06:50:13,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:13,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:13,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:13,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:13,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:13,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:13,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 140 transitions, 357 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:13,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:13,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:13,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:13,661 INFO L124 PetriNetUnfolderBase]: 4136/8034 cut-off events. [2025-01-10 06:50:13,661 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-01-10 06:50:13,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13718 conditions, 8034 events. 4136/8034 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66096 event pairs, 2732 based on Foata normal form. 2/6398 useless extension candidates. Maximal degree in co-relation 13709. Up to 5507 conditions per place. [2025-01-10 06:50:13,703 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 70 selfloop transitions, 1 changer transitions 0/138 dead transitions. [2025-01-10 06:50:13,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 138 transitions, 495 flow [2025-01-10 06:50:13,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-01-10 06:50:13,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2025-01-10 06:50:13,705 INFO L175 Difference]: Start difference. First operand has 128 places, 140 transitions, 357 flow. Second operand 3 states and 286 transitions. [2025-01-10 06:50:13,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 138 transitions, 495 flow [2025-01-10 06:50:13,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 138 transitions, 486 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:13,708 INFO L231 Difference]: Finished difference. Result has 127 places, 138 transitions, 346 flow [2025-01-10 06:50:13,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=127, PETRI_TRANSITIONS=138} [2025-01-10 06:50:13,709 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -3 predicate places. [2025-01-10 06:50:13,709 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 138 transitions, 346 flow [2025-01-10 06:50:13,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:13,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:13,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:50:13,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:50:13,709 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:13,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:13,712 INFO L85 PathProgramCache]: Analyzing trace with hash -726039546, now seen corresponding path program 1 times [2025-01-10 06:50:13,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:13,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403463320] [2025-01-10 06:50:13,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:13,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:13,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:50:13,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:50:13,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:13,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:13,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:13,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403463320] [2025-01-10 06:50:13,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403463320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:13,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:13,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:13,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830344374] [2025-01-10 06:50:13,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:13,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:13,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:13,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:13,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:13,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:13,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 138 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:13,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:13,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:13,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:14,340 INFO L124 PetriNetUnfolderBase]: 4136/8032 cut-off events. [2025-01-10 06:50:14,341 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-01-10 06:50:14,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13709 conditions, 8032 events. 4136/8032 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66102 event pairs, 2732 based on Foata normal form. 1/6396 useless extension candidates. Maximal degree in co-relation 13699. Up to 5505 conditions per place. [2025-01-10 06:50:14,375 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 68 selfloop transitions, 1 changer transitions 0/136 dead transitions. [2025-01-10 06:50:14,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 136 transitions, 480 flow [2025-01-10 06:50:14,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-01-10 06:50:14,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-01-10 06:50:14,377 INFO L175 Difference]: Start difference. First operand has 127 places, 138 transitions, 346 flow. Second operand 3 states and 284 transitions. [2025-01-10 06:50:14,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 136 transitions, 480 flow [2025-01-10 06:50:14,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 136 transitions, 479 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:14,379 INFO L231 Difference]: Finished difference. Result has 126 places, 136 transitions, 343 flow [2025-01-10 06:50:14,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=126, PETRI_TRANSITIONS=136} [2025-01-10 06:50:14,379 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-01-10 06:50:14,379 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 136 transitions, 343 flow [2025-01-10 06:50:14,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:14,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:14,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:14,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:50:14,381 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:14,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:14,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1939256342, now seen corresponding path program 1 times [2025-01-10 06:50:14,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:14,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438969946] [2025-01-10 06:50:14,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:14,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:14,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:50:14,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:50:14,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:14,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:14,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:14,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438969946] [2025-01-10 06:50:14,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438969946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:14,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:14,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:14,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753749251] [2025-01-10 06:50:14,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:14,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:14,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:14,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:14,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:14,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:14,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 136 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:14,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:14,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:14,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:14,921 INFO L124 PetriNetUnfolderBase]: 4136/8030 cut-off events. [2025-01-10 06:50:14,921 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-01-10 06:50:14,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13710 conditions, 8030 events. 4136/8030 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66081 event pairs, 2732 based on Foata normal form. 2/6396 useless extension candidates. Maximal degree in co-relation 13699. Up to 5507 conditions per place. [2025-01-10 06:50:14,960 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 70 selfloop transitions, 1 changer transitions 0/134 dead transitions. [2025-01-10 06:50:14,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 134 transitions, 481 flow [2025-01-10 06:50:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-01-10 06:50:14,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2025-01-10 06:50:14,962 INFO L175 Difference]: Start difference. First operand has 126 places, 136 transitions, 343 flow. Second operand 3 states and 286 transitions. [2025-01-10 06:50:14,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 134 transitions, 481 flow [2025-01-10 06:50:14,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 134 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:14,964 INFO L231 Difference]: Finished difference. Result has 125 places, 134 transitions, 340 flow [2025-01-10 06:50:14,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=125, PETRI_TRANSITIONS=134} [2025-01-10 06:50:14,968 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -5 predicate places. [2025-01-10 06:50:14,968 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 134 transitions, 340 flow [2025-01-10 06:50:14,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:14,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:14,968 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:14,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:50:14,968 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:14,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:14,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1940757284, now seen corresponding path program 1 times [2025-01-10 06:50:14,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:14,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026480112] [2025-01-10 06:50:14,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:14,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:14,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:50:14,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:50:14,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:14,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:15,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:15,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026480112] [2025-01-10 06:50:15,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026480112] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:15,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682454154] [2025-01-10 06:50:15,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:15,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:15,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:15,080 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:50:15,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:50:15,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:50:15,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:50:15,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:15,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:15,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:50:15,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:15,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:50:15,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682454154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:15,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:50:15,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:50:15,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689481476] [2025-01-10 06:50:15,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:15,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:50:15,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:15,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:50:15,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:50:15,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 06:50:15,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 134 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:15,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:15,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 06:50:15,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:15,683 INFO L124 PetriNetUnfolderBase]: 4136/8027 cut-off events. [2025-01-10 06:50:15,683 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-01-10 06:50:15,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13706 conditions, 8027 events. 4136/8027 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66032 event pairs, 2732 based on Foata normal form. 3/6392 useless extension candidates. Maximal degree in co-relation 13694. Up to 5491 conditions per place. [2025-01-10 06:50:15,720 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 51 selfloop transitions, 21 changer transitions 0/131 dead transitions. [2025-01-10 06:50:15,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 131 transitions, 472 flow [2025-01-10 06:50:15,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:50:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:50:15,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2025-01-10 06:50:15,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6035714285714285 [2025-01-10 06:50:15,722 INFO L175 Difference]: Start difference. First operand has 125 places, 134 transitions, 340 flow. Second operand 6 states and 507 transitions. [2025-01-10 06:50:15,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 131 transitions, 472 flow [2025-01-10 06:50:15,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 131 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:15,724 INFO L231 Difference]: Finished difference. Result has 126 places, 131 transitions, 369 flow [2025-01-10 06:50:15,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=369, PETRI_PLACES=126, PETRI_TRANSITIONS=131} [2025-01-10 06:50:15,728 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-01-10 06:50:15,728 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 131 transitions, 369 flow [2025-01-10 06:50:15,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:15,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:15,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:15,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:50:15,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:15,931 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:15,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:15,932 INFO L85 PathProgramCache]: Analyzing trace with hash 12597036, now seen corresponding path program 1 times [2025-01-10 06:50:15,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:15,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847283186] [2025-01-10 06:50:15,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:15,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:50:15,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:50:15,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:15,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:15,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:15,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847283186] [2025-01-10 06:50:15,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847283186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:15,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:15,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:15,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074356867] [2025-01-10 06:50:15,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:15,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:15,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:15,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:15,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:15,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:15,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 131 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:15,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:15,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:15,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:16,379 INFO L124 PetriNetUnfolderBase]: 4136/8025 cut-off events. [2025-01-10 06:50:16,380 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-01-10 06:50:16,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13722 conditions, 8025 events. 4136/8025 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66009 event pairs, 2732 based on Foata normal form. 1/6391 useless extension candidates. Maximal degree in co-relation 13710. Up to 5505 conditions per place. [2025-01-10 06:50:16,411 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 68 selfloop transitions, 1 changer transitions 0/129 dead transitions. [2025-01-10 06:50:16,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 129 transitions, 503 flow [2025-01-10 06:50:16,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-01-10 06:50:16,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-01-10 06:50:16,413 INFO L175 Difference]: Start difference. First operand has 126 places, 131 transitions, 369 flow. Second operand 3 states and 284 transitions. [2025-01-10 06:50:16,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 129 transitions, 503 flow [2025-01-10 06:50:16,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 129 transitions, 458 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:16,415 INFO L231 Difference]: Finished difference. Result has 122 places, 129 transitions, 322 flow [2025-01-10 06:50:16,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=122, PETRI_TRANSITIONS=129} [2025-01-10 06:50:16,416 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -8 predicate places. [2025-01-10 06:50:16,416 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 129 transitions, 322 flow [2025-01-10 06:50:16,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:16,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:16,416 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:50:16,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:50:16,417 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:16,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:16,417 INFO L85 PathProgramCache]: Analyzing trace with hash -33932192, now seen corresponding path program 1 times [2025-01-10 06:50:16,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:16,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829370817] [2025-01-10 06:50:16,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:16,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:16,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:50:16,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:50:16,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:16,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:16,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:16,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829370817] [2025-01-10 06:50:16,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829370817] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:16,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456724902] [2025-01-10 06:50:16,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:16,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:16,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:16,482 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:50:16,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:50:16,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:50:16,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:50:16,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:16,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:16,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:50:16,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:16,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:16,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456724902] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:16,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:16,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:50:16,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296496848] [2025-01-10 06:50:16,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:16,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:50:16,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:16,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:50:16,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:50:16,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 06:50:16,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 129 transitions, 322 flow. Second operand has 12 states, 12 states have (on average 73.16666666666667) internal successors, (878), 12 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:16,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:16,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 06:50:16,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:17,302 INFO L124 PetriNetUnfolderBase]: 4145/8061 cut-off events. [2025-01-10 06:50:17,303 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-01-10 06:50:17,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13791 conditions, 8061 events. 4145/8061 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66211 event pairs, 2732 based on Foata normal form. 9/6426 useless extension candidates. Maximal degree in co-relation 13779. Up to 5512 conditions per place. [2025-01-10 06:50:17,323 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 60 selfloop transitions, 39 changer transitions 0/156 dead transitions. [2025-01-10 06:50:17,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 156 transitions, 637 flow [2025-01-10 06:50:17,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:50:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:50:17,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 828 transitions. [2025-01-10 06:50:17,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914285714285714 [2025-01-10 06:50:17,327 INFO L175 Difference]: Start difference. First operand has 122 places, 129 transitions, 322 flow. Second operand 10 states and 828 transitions. [2025-01-10 06:50:17,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 156 transitions, 637 flow [2025-01-10 06:50:17,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 156 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:17,330 INFO L231 Difference]: Finished difference. Result has 133 places, 156 transitions, 570 flow [2025-01-10 06:50:17,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=570, PETRI_PLACES=133, PETRI_TRANSITIONS=156} [2025-01-10 06:50:17,330 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-01-10 06:50:17,331 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 156 transitions, 570 flow [2025-01-10 06:50:17,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 73.16666666666667) internal successors, (878), 12 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:17,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:17,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:17,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:50:17,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:17,532 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:17,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:17,532 INFO L85 PathProgramCache]: Analyzing trace with hash -204637991, now seen corresponding path program 1 times [2025-01-10 06:50:17,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:17,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621402548] [2025-01-10 06:50:17,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:17,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:17,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:50:17,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:50:17,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:17,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:17,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:17,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621402548] [2025-01-10 06:50:17,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621402548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:17,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:17,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:17,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280206811] [2025-01-10 06:50:17,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:17,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:17,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:17,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:17,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:17,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 06:50:17,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 156 transitions, 570 flow. Second operand has 4 states, 4 states have (on average 74.5) internal successors, (298), 4 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:17,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:17,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 06:50:17,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:18,040 INFO L124 PetriNetUnfolderBase]: 4148/8073 cut-off events. [2025-01-10 06:50:18,040 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-01-10 06:50:18,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13884 conditions, 8073 events. 4148/8073 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66297 event pairs, 2732 based on Foata normal form. 3/6438 useless extension candidates. Maximal degree in co-relation 13869. Up to 5542 conditions per place. [2025-01-10 06:50:18,071 INFO L140 encePairwiseOnDemand]: 122/140 looper letters, 99 selfloop transitions, 12 changer transitions 0/165 dead transitions. [2025-01-10 06:50:18,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 165 transitions, 810 flow [2025-01-10 06:50:18,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:18,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2025-01-10 06:50:18,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6589285714285714 [2025-01-10 06:50:18,073 INFO L175 Difference]: Start difference. First operand has 133 places, 156 transitions, 570 flow. Second operand 4 states and 369 transitions. [2025-01-10 06:50:18,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 165 transitions, 810 flow [2025-01-10 06:50:18,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 165 transitions, 777 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-01-10 06:50:18,076 INFO L231 Difference]: Finished difference. Result has 136 places, 165 transitions, 624 flow [2025-01-10 06:50:18,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=624, PETRI_PLACES=136, PETRI_TRANSITIONS=165} [2025-01-10 06:50:18,077 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 6 predicate places. [2025-01-10 06:50:18,077 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 165 transitions, 624 flow [2025-01-10 06:50:18,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 4 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:18,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:18,077 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:18,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:50:18,077 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:18,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:18,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1810373610, now seen corresponding path program 1 times [2025-01-10 06:50:18,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:18,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934585380] [2025-01-10 06:50:18,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:18,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:18,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:50:18,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:50:18,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:18,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:18,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:18,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934585380] [2025-01-10 06:50:18,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934585380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:18,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:18,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:18,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206861751] [2025-01-10 06:50:18,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:18,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:18,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:18,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:18,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:18,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:18,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 165 transitions, 624 flow. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:18,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:18,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:18,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:18,758 INFO L124 PetriNetUnfolderBase]: 4147/8072 cut-off events. [2025-01-10 06:50:18,759 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2025-01-10 06:50:18,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13899 conditions, 8072 events. 4147/8072 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66270 event pairs, 2732 based on Foata normal form. 1/6441 useless extension candidates. Maximal degree in co-relation 13881. Up to 5538 conditions per place. [2025-01-10 06:50:18,794 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 101 selfloop transitions, 3 changer transitions 0/164 dead transitions. [2025-01-10 06:50:18,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 164 transitions, 828 flow [2025-01-10 06:50:18,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:18,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:18,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-01-10 06:50:18,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-01-10 06:50:18,796 INFO L175 Difference]: Start difference. First operand has 136 places, 165 transitions, 624 flow. Second operand 4 states and 359 transitions. [2025-01-10 06:50:18,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 164 transitions, 828 flow [2025-01-10 06:50:18,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 164 transitions, 819 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:18,799 INFO L231 Difference]: Finished difference. Result has 138 places, 164 transitions, 617 flow [2025-01-10 06:50:18,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=617, PETRI_PLACES=138, PETRI_TRANSITIONS=164} [2025-01-10 06:50:18,799 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 8 predicate places. [2025-01-10 06:50:18,800 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 164 transitions, 617 flow [2025-01-10 06:50:18,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:18,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:18,800 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-01-10 06:50:18,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:50:18,800 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:18,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:18,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1342633387, now seen corresponding path program 2 times [2025-01-10 06:50:18,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:18,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584228526] [2025-01-10 06:50:18,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:50:18,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:18,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 06:50:18,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-01-10 06:50:18,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:50:18,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:50:18,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:18,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584228526] [2025-01-10 06:50:18,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584228526] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:18,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349348443] [2025-01-10 06:50:18,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:50:18,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:18,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:18,853 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:50:18,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:50:18,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 06:50:18,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-01-10 06:50:18,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:50:18,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:18,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:50:18,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:50:18,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:50:18,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349348443] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:18,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:18,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-01-10 06:50:18,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605952715] [2025-01-10 06:50:18,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:18,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:50:18,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:18,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:50:18,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:50:18,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 140 [2025-01-10 06:50:18,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 164 transitions, 617 flow. Second operand has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:18,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:18,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 140 [2025-01-10 06:50:18,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:19,498 INFO L124 PetriNetUnfolderBase]: 4147/8069 cut-off events. [2025-01-10 06:50:19,498 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2025-01-10 06:50:19,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13881 conditions, 8069 events. 4147/8069 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66248 event pairs, 2732 based on Foata normal form. 3/6440 useless extension candidates. Maximal degree in co-relation 13862. Up to 5507 conditions per place. [2025-01-10 06:50:19,527 INFO L140 encePairwiseOnDemand]: 124/140 looper letters, 56 selfloop transitions, 48 changer transitions 0/161 dead transitions. [2025-01-10 06:50:19,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 161 transitions, 795 flow [2025-01-10 06:50:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:50:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:50:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 403 transitions. [2025-01-10 06:50:19,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757142857142857 [2025-01-10 06:50:19,529 INFO L175 Difference]: Start difference. First operand has 138 places, 164 transitions, 617 flow. Second operand 5 states and 403 transitions. [2025-01-10 06:50:19,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 161 transitions, 795 flow [2025-01-10 06:50:19,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 161 transitions, 761 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 06:50:19,532 INFO L231 Difference]: Finished difference. Result has 133 places, 161 transitions, 649 flow [2025-01-10 06:50:19,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=649, PETRI_PLACES=133, PETRI_TRANSITIONS=161} [2025-01-10 06:50:19,533 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-01-10 06:50:19,533 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 161 transitions, 649 flow [2025-01-10 06:50:19,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:19,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:19,533 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:19,539 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-01-10 06:50:19,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:19,734 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:19,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash 2143615617, now seen corresponding path program 1 times [2025-01-10 06:50:19,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:19,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826684702] [2025-01-10 06:50:19,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:19,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:19,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:50:19,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:50:19,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:19,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:19,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:19,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826684702] [2025-01-10 06:50:19,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826684702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:19,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:19,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:19,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234171236] [2025-01-10 06:50:19,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:19,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:19,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:19,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:19,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:19,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:19,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 161 transitions, 649 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 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-01-10 06:50:19,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:19,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:19,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:20,337 INFO L124 PetriNetUnfolderBase]: 4146/8068 cut-off events. [2025-01-10 06:50:20,338 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-01-10 06:50:20,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13904 conditions, 8068 events. 4146/8068 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66253 event pairs, 2732 based on Foata normal form. 0/6426 useless extension candidates. Maximal degree in co-relation 13889. Up to 5537 conditions per place. [2025-01-10 06:50:20,378 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 100 selfloop transitions, 3 changer transitions 0/160 dead transitions. [2025-01-10 06:50:20,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 160 transitions, 849 flow [2025-01-10 06:50:20,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-01-10 06:50:20,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-01-10 06:50:20,380 INFO L175 Difference]: Start difference. First operand has 133 places, 161 transitions, 649 flow. Second operand 4 states and 359 transitions. [2025-01-10 06:50:20,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 160 transitions, 849 flow [2025-01-10 06:50:20,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 160 transitions, 755 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:20,383 INFO L231 Difference]: Finished difference. Result has 132 places, 160 transitions, 555 flow [2025-01-10 06:50:20,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=555, PETRI_PLACES=132, PETRI_TRANSITIONS=160} [2025-01-10 06:50:20,383 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-01-10 06:50:20,383 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 160 transitions, 555 flow [2025-01-10 06:50:20,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 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-01-10 06:50:20,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:20,384 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] [2025-01-10 06:50:20,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:50:20,384 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:20,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:20,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1040978514, now seen corresponding path program 1 times [2025-01-10 06:50:20,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:20,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025817564] [2025-01-10 06:50:20,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:20,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:20,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 06:50:20,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:50:20,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:20,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:50:20,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:20,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025817564] [2025-01-10 06:50:20,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025817564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:20,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:20,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:20,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271477688] [2025-01-10 06:50:20,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:20,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:20,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:20,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:20,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:20,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:20,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 160 transitions, 555 flow. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:20,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:20,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:20,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:20,892 INFO L124 PetriNetUnfolderBase]: 4145/8067 cut-off events. [2025-01-10 06:50:20,892 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-01-10 06:50:20,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13857 conditions, 8067 events. 4145/8067 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66258 event pairs, 2732 based on Foata normal form. 0/6426 useless extension candidates. Maximal degree in co-relation 13842. Up to 5536 conditions per place. [2025-01-10 06:50:20,925 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 99 selfloop transitions, 3 changer transitions 0/159 dead transitions. [2025-01-10 06:50:20,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 159 transitions, 755 flow [2025-01-10 06:50:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-01-10 06:50:20,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-01-10 06:50:20,927 INFO L175 Difference]: Start difference. First operand has 132 places, 160 transitions, 555 flow. Second operand 4 states and 359 transitions. [2025-01-10 06:50:20,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 159 transitions, 755 flow [2025-01-10 06:50:20,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 159 transitions, 751 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:50:20,929 INFO L231 Difference]: Finished difference. Result has 133 places, 159 transitions, 553 flow [2025-01-10 06:50:20,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=553, PETRI_PLACES=133, PETRI_TRANSITIONS=159} [2025-01-10 06:50:20,930 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-01-10 06:50:20,930 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 159 transitions, 553 flow [2025-01-10 06:50:20,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:20,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:20,930 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-01-10 06:50:20,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:50:20,931 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:20,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:20,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1589217077, now seen corresponding path program 1 times [2025-01-10 06:50:20,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:20,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049930952] [2025-01-10 06:50:20,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:20,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:20,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:50:20,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:50:20,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:20,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:21,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:21,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049930952] [2025-01-10 06:50:21,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049930952] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:21,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692815405] [2025-01-10 06:50:21,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:21,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:21,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:21,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:50:21,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:50:21,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:50:21,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:50:21,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:21,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:21,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:50:21,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:21,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:50:21,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692815405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:21,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:50:21,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:50:21,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863702791] [2025-01-10 06:50:21,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:21,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:50:21,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:21,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:50:21,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:50:21,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 06:50:21,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 159 transitions, 553 flow. Second operand has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:21,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:21,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 06:50:21,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:21,678 INFO L124 PetriNetUnfolderBase]: 4145/8064 cut-off events. [2025-01-10 06:50:21,678 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-01-10 06:50:21,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13855 conditions, 8064 events. 4145/8064 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66176 event pairs, 2732 based on Foata normal form. 3/6423 useless extension candidates. Maximal degree in co-relation 13840. Up to 5524 conditions per place. [2025-01-10 06:50:21,700 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 84 selfloop transitions, 21 changer transitions 0/156 dead transitions. [2025-01-10 06:50:21,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 156 transitions, 751 flow [2025-01-10 06:50:21,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:50:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:50:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2025-01-10 06:50:21,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6035714285714285 [2025-01-10 06:50:21,701 INFO L175 Difference]: Start difference. First operand has 133 places, 159 transitions, 553 flow. Second operand 6 states and 507 transitions. [2025-01-10 06:50:21,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 156 transitions, 751 flow [2025-01-10 06:50:21,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 156 transitions, 747 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:50:21,704 INFO L231 Difference]: Finished difference. Result has 133 places, 156 transitions, 579 flow [2025-01-10 06:50:21,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=579, PETRI_PLACES=133, PETRI_TRANSITIONS=156} [2025-01-10 06:50:21,704 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-01-10 06:50:21,704 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 156 transitions, 579 flow [2025-01-10 06:50:21,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:21,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:21,705 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-10 06:50:21,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:50:21,905 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,SelfDestructingSolverStorable14 [2025-01-10 06:50:21,906 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:21,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:21,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2021090562, now seen corresponding path program 1 times [2025-01-10 06:50:21,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:21,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410652592] [2025-01-10 06:50:21,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:21,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:21,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:50:21,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:50:21,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:21,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:22,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:22,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410652592] [2025-01-10 06:50:22,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410652592] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:22,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285751699] [2025-01-10 06:50:22,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:22,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:22,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:22,024 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:50:22,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:50:22,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:50:22,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:50:22,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:22,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:22,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:50:22,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:22,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:22,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285751699] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:22,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:22,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:50:22,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615177552] [2025-01-10 06:50:22,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:22,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:50:22,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:22,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:50:22,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:50:22,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 06:50:22,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 156 transitions, 579 flow. Second operand has 12 states, 12 states have (on average 74.16666666666667) internal successors, (890), 12 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:22,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:22,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 06:50:22,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:22,805 INFO L124 PetriNetUnfolderBase]: 4154/8100 cut-off events. [2025-01-10 06:50:22,805 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2025-01-10 06:50:22,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13991 conditions, 8100 events. 4154/8100 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66519 event pairs, 2732 based on Foata normal form. 9/6459 useless extension candidates. Maximal degree in co-relation 13977. Up to 5545 conditions per place. [2025-01-10 06:50:22,837 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 93 selfloop transitions, 39 changer transitions 0/183 dead transitions. [2025-01-10 06:50:22,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 183 transitions, 1005 flow [2025-01-10 06:50:22,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:50:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:50:22,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 828 transitions. [2025-01-10 06:50:22,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914285714285714 [2025-01-10 06:50:22,839 INFO L175 Difference]: Start difference. First operand has 133 places, 156 transitions, 579 flow. Second operand 10 states and 828 transitions. [2025-01-10 06:50:22,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 183 transitions, 1005 flow [2025-01-10 06:50:22,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 183 transitions, 915 flow, removed 24 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:22,842 INFO L231 Difference]: Finished difference. Result has 141 places, 183 transitions, 783 flow [2025-01-10 06:50:22,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=783, PETRI_PLACES=141, PETRI_TRANSITIONS=183} [2025-01-10 06:50:22,843 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 11 predicate places. [2025-01-10 06:50:22,843 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 183 transitions, 783 flow [2025-01-10 06:50:22,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 74.16666666666667) internal successors, (890), 12 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:22,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:22,844 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] [2025-01-10 06:50:22,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:50:23,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 06:50:23,045 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:23,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:23,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1918049462, now seen corresponding path program 1 times [2025-01-10 06:50:23,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:23,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842376807] [2025-01-10 06:50:23,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:23,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:23,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 06:50:23,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 06:50:23,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:23,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:23,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:23,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842376807] [2025-01-10 06:50:23,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842376807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:23,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:23,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:23,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402337482] [2025-01-10 06:50:23,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:23,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:23,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:23,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:23,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:23,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 06:50:23,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 183 transitions, 783 flow. Second operand has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:23,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:23,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 06:50:23,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:23,957 INFO L124 PetriNetUnfolderBase]: 8085/14330 cut-off events. [2025-01-10 06:50:23,957 INFO L125 PetriNetUnfolderBase]: For 209/209 co-relation queries the response was YES. [2025-01-10 06:50:23,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25623 conditions, 14330 events. 8085/14330 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 118098 event pairs, 2473 based on Foata normal form. 364/12005 useless extension candidates. Maximal degree in co-relation 25607. Up to 5110 conditions per place. [2025-01-10 06:50:24,025 INFO L140 encePairwiseOnDemand]: 132/140 looper letters, 179 selfloop transitions, 5 changer transitions 0/232 dead transitions. [2025-01-10 06:50:24,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 232 transitions, 1255 flow [2025-01-10 06:50:24,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:24,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2025-01-10 06:50:24,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.725 [2025-01-10 06:50:24,026 INFO L175 Difference]: Start difference. First operand has 141 places, 183 transitions, 783 flow. Second operand 4 states and 406 transitions. [2025-01-10 06:50:24,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 232 transitions, 1255 flow [2025-01-10 06:50:24,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 232 transitions, 1222 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-01-10 06:50:24,032 INFO L231 Difference]: Finished difference. Result has 144 places, 185 transitions, 784 flow [2025-01-10 06:50:24,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=784, PETRI_PLACES=144, PETRI_TRANSITIONS=185} [2025-01-10 06:50:24,032 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 14 predicate places. [2025-01-10 06:50:24,032 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 185 transitions, 784 flow [2025-01-10 06:50:24,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:24,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:24,033 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] [2025-01-10 06:50:24,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:50:24,033 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:24,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:24,033 INFO L85 PathProgramCache]: Analyzing trace with hash -670007274, now seen corresponding path program 1 times [2025-01-10 06:50:24,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:24,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036386674] [2025-01-10 06:50:24,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:24,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:24,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:50:24,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:50:24,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:24,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:24,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:24,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036386674] [2025-01-10 06:50:24,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036386674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:24,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:24,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:24,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515517519] [2025-01-10 06:50:24,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:24,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:24,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:24,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:24,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:24,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:24,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 185 transitions, 784 flow. Second operand has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:24,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:24,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:24,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:24,974 INFO L124 PetriNetUnfolderBase]: 5198/10359 cut-off events. [2025-01-10 06:50:24,975 INFO L125 PetriNetUnfolderBase]: For 1978/2244 co-relation queries the response was YES. [2025-01-10 06:50:25,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19179 conditions, 10359 events. 5198/10359 cut-off events. For 1978/2244 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 90490 event pairs, 3504 based on Foata normal form. 136/8559 useless extension candidates. Maximal degree in co-relation 19160. Up to 6971 conditions per place. [2025-01-10 06:50:25,047 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 127 selfloop transitions, 3 changer transitions 0/184 dead transitions. [2025-01-10 06:50:25,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 184 transitions, 1040 flow [2025-01-10 06:50:25,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-01-10 06:50:25,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-01-10 06:50:25,048 INFO L175 Difference]: Start difference. First operand has 144 places, 185 transitions, 784 flow. Second operand 4 states and 359 transitions. [2025-01-10 06:50:25,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 184 transitions, 1040 flow [2025-01-10 06:50:25,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 184 transitions, 1040 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:50:25,061 INFO L231 Difference]: Finished difference. Result has 147 places, 184 transitions, 786 flow [2025-01-10 06:50:25,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=786, PETRI_PLACES=147, PETRI_TRANSITIONS=184} [2025-01-10 06:50:25,061 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 17 predicate places. [2025-01-10 06:50:25,061 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 184 transitions, 786 flow [2025-01-10 06:50:25,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:25,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:25,062 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:25,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:50:25,062 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:25,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:25,062 INFO L85 PathProgramCache]: Analyzing trace with hash 807328381, now seen corresponding path program 2 times [2025-01-10 06:50:25,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:25,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379614838] [2025-01-10 06:50:25,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:50:25,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:25,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 06:50:25,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 36 statements. [2025-01-10 06:50:25,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:50:25,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 06:50:25,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:25,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379614838] [2025-01-10 06:50:25,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379614838] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:25,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729907450] [2025-01-10 06:50:25,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:50:25,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:25,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:25,150 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:50:25,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:50:25,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 06:50:25,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 36 statements. [2025-01-10 06:50:25,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:50:25,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:25,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:50:25,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 06:50:25,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 06:50:25,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729907450] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:25,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:25,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 4 [2025-01-10 06:50:25,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682327284] [2025-01-10 06:50:25,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:25,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:50:25,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:25,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:50:25,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:50:25,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 140 [2025-01-10 06:50:25,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 184 transitions, 786 flow. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:25,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:25,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 140 [2025-01-10 06:50:25,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:26,150 INFO L124 PetriNetUnfolderBase]: 5198/10356 cut-off events. [2025-01-10 06:50:26,150 INFO L125 PetriNetUnfolderBase]: For 1994/2260 co-relation queries the response was YES. [2025-01-10 06:50:26,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19168 conditions, 10356 events. 5198/10356 cut-off events. For 1994/2260 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 90425 event pairs, 3504 based on Foata normal form. 138/8558 useless extension candidates. Maximal degree in co-relation 19147. Up to 6940 conditions per place. [2025-01-10 06:50:26,189 INFO L140 encePairwiseOnDemand]: 124/140 looper letters, 82 selfloop transitions, 48 changer transitions 0/181 dead transitions. [2025-01-10 06:50:26,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 181 transitions, 1016 flow [2025-01-10 06:50:26,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:50:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:50:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 403 transitions. [2025-01-10 06:50:26,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757142857142857 [2025-01-10 06:50:26,191 INFO L175 Difference]: Start difference. First operand has 147 places, 184 transitions, 786 flow. Second operand 5 states and 403 transitions. [2025-01-10 06:50:26,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 181 transitions, 1016 flow [2025-01-10 06:50:26,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 181 transitions, 982 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 06:50:26,200 INFO L231 Difference]: Finished difference. Result has 142 places, 181 transitions, 818 flow [2025-01-10 06:50:26,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=818, PETRI_PLACES=142, PETRI_TRANSITIONS=181} [2025-01-10 06:50:26,200 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 12 predicate places. [2025-01-10 06:50:26,200 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 181 transitions, 818 flow [2025-01-10 06:50:26,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:26,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:26,200 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] [2025-01-10 06:50:26,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 06:50:26,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:26,405 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:26,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:26,405 INFO L85 PathProgramCache]: Analyzing trace with hash -68219877, now seen corresponding path program 1 times [2025-01-10 06:50:26,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:26,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751915232] [2025-01-10 06:50:26,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:26,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:26,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 06:50:26,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 06:50:26,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:26,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:50:26,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:26,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751915232] [2025-01-10 06:50:26,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751915232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:26,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:26,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:26,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809360930] [2025-01-10 06:50:26,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:26,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:26,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:26,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:26,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:26,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:26,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 181 transitions, 818 flow. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:26,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:26,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:26,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:27,056 INFO L124 PetriNetUnfolderBase]: 5197/10355 cut-off events. [2025-01-10 06:50:27,056 INFO L125 PetriNetUnfolderBase]: For 2002/2268 co-relation queries the response was YES. [2025-01-10 06:50:27,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19191 conditions, 10355 events. 5197/10355 cut-off events. For 2002/2268 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 90330 event pairs, 3504 based on Foata normal form. 135/8544 useless extension candidates. Maximal degree in co-relation 19174. Up to 6970 conditions per place. [2025-01-10 06:50:27,108 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 126 selfloop transitions, 3 changer transitions 0/180 dead transitions. [2025-01-10 06:50:27,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 180 transitions, 1070 flow [2025-01-10 06:50:27,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-01-10 06:50:27,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-01-10 06:50:27,110 INFO L175 Difference]: Start difference. First operand has 142 places, 181 transitions, 818 flow. Second operand 4 states and 359 transitions. [2025-01-10 06:50:27,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 180 transitions, 1070 flow [2025-01-10 06:50:27,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 180 transitions, 976 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:27,126 INFO L231 Difference]: Finished difference. Result has 141 places, 180 transitions, 724 flow [2025-01-10 06:50:27,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=724, PETRI_PLACES=141, PETRI_TRANSITIONS=180} [2025-01-10 06:50:27,126 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 11 predicate places. [2025-01-10 06:50:27,126 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 180 transitions, 724 flow [2025-01-10 06:50:27,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:27,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:27,126 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-01-10 06:50:27,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:50:27,126 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:27,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:27,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1980350512, now seen corresponding path program 1 times [2025-01-10 06:50:27,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:27,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38837154] [2025-01-10 06:50:27,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:27,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:27,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 06:50:27,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 06:50:27,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:27,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:27,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:50:27,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:27,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38837154] [2025-01-10 06:50:27,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38837154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:27,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:27,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:27,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118747088] [2025-01-10 06:50:27,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:27,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:27,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:27,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:27,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:27,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:27,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 180 transitions, 724 flow. Second operand has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:27,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:27,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:27,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:27,841 INFO L124 PetriNetUnfolderBase]: 5196/10354 cut-off events. [2025-01-10 06:50:27,841 INFO L125 PetriNetUnfolderBase]: For 1957/2223 co-relation queries the response was YES. [2025-01-10 06:50:27,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19144 conditions, 10354 events. 5196/10354 cut-off events. For 1957/2223 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 90277 event pairs, 3504 based on Foata normal form. 135/8544 useless extension candidates. Maximal degree in co-relation 19127. Up to 6969 conditions per place. [2025-01-10 06:50:27,894 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 125 selfloop transitions, 3 changer transitions 0/179 dead transitions. [2025-01-10 06:50:27,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 179 transitions, 976 flow [2025-01-10 06:50:27,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-01-10 06:50:27,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-01-10 06:50:27,895 INFO L175 Difference]: Start difference. First operand has 141 places, 180 transitions, 724 flow. Second operand 4 states and 359 transitions. [2025-01-10 06:50:27,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 179 transitions, 976 flow [2025-01-10 06:50:27,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 179 transitions, 972 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:50:27,906 INFO L231 Difference]: Finished difference. Result has 142 places, 179 transitions, 722 flow [2025-01-10 06:50:27,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=722, PETRI_PLACES=142, PETRI_TRANSITIONS=179} [2025-01-10 06:50:27,907 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 12 predicate places. [2025-01-10 06:50:27,907 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 179 transitions, 722 flow [2025-01-10 06:50:27,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:27,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:27,907 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-01-10 06:50:27,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:50:27,907 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:27,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:27,908 INFO L85 PathProgramCache]: Analyzing trace with hash 420114226, now seen corresponding path program 1 times [2025-01-10 06:50:27,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:27,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227614896] [2025-01-10 06:50:27,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:27,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:27,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 06:50:27,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 06:50:27,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:27,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:50:28,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:28,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227614896] [2025-01-10 06:50:28,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227614896] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:28,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230098966] [2025-01-10 06:50:28,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:28,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:28,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:28,506 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:50:28,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:50:28,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 06:50:28,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 06:50:28,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:28,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:28,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 06:50:28,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:28,654 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-01-10 06:50:28,686 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 23 treesize of output 1 [2025-01-10 06:50:28,858 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:50:28,858 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-01-10 06:50:28,906 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-01-10 06:50:29,099 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 06:50:29,099 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 23 treesize of output 10 [2025-01-10 06:50:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:50:29,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:29,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:50:29,315 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-01-10 06:50:29,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:50:29,323 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 41 treesize of output 33 [2025-01-10 06:50:29,329 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 7 [2025-01-10 06:50:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:50:29,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230098966] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:29,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:29,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-01-10 06:50:29,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125764484] [2025-01-10 06:50:29,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:29,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 06:50:29,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:29,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 06:50:29,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=412, Unknown=9, NotChecked=0, Total=506 [2025-01-10 06:50:30,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 140 [2025-01-10 06:50:30,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 179 transitions, 722 flow. Second operand has 23 states, 23 states have (on average 57.869565217391305) internal successors, (1331), 23 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:30,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:30,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 140 [2025-01-10 06:50:30,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:36,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:50:40,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:50:45,878 INFO L124 PetriNetUnfolderBase]: 38905/59289 cut-off events. [2025-01-10 06:50:45,879 INFO L125 PetriNetUnfolderBase]: For 5852/6073 co-relation queries the response was YES. [2025-01-10 06:50:46,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120848 conditions, 59289 events. 38905/59289 cut-off events. For 5852/6073 co-relation queries the response was YES. Maximal size of possible extension queue 2680. Compared 470360 event pairs, 8741 based on Foata normal form. 221/52102 useless extension candidates. Maximal degree in co-relation 120831. Up to 12393 conditions per place. [2025-01-10 06:50:46,350 INFO L140 encePairwiseOnDemand]: 123/140 looper letters, 417 selfloop transitions, 72 changer transitions 0/526 dead transitions. [2025-01-10 06:50:46,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 526 transitions, 2905 flow [2025-01-10 06:50:46,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:50:46,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:50:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1531 transitions. [2025-01-10 06:50:46,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49707792207792206 [2025-01-10 06:50:46,354 INFO L175 Difference]: Start difference. First operand has 142 places, 179 transitions, 722 flow. Second operand 22 states and 1531 transitions. [2025-01-10 06:50:46,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 526 transitions, 2905 flow [2025-01-10 06:50:46,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 526 transitions, 2897 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:50:46,470 INFO L231 Difference]: Finished difference. Result has 166 places, 218 transitions, 1151 flow [2025-01-10 06:50:46,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1151, PETRI_PLACES=166, PETRI_TRANSITIONS=218} [2025-01-10 06:50:46,470 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 36 predicate places. [2025-01-10 06:50:46,470 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 218 transitions, 1151 flow [2025-01-10 06:50:46,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 57.869565217391305) internal successors, (1331), 23 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:46,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:46,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, 1, 1, 1] [2025-01-10 06:50:46,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:50:46,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:46,676 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:46,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:46,676 INFO L85 PathProgramCache]: Analyzing trace with hash 573812488, now seen corresponding path program 1 times [2025-01-10 06:50:46,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:46,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81070921] [2025-01-10 06:50:46,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:46,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:46,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 06:50:46,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 06:50:46,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:46,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 06:50:46,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:46,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81070921] [2025-01-10 06:50:46,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81070921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:46,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:46,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:46,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153767409] [2025-01-10 06:50:46,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:46,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:46,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:46,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:46,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:46,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 06:50:46,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 218 transitions, 1151 flow. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:46,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:46,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 06:50:46,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:51,106 INFO L124 PetriNetUnfolderBase]: 32739/58019 cut-off events. [2025-01-10 06:50:51,106 INFO L125 PetriNetUnfolderBase]: For 28367/30045 co-relation queries the response was YES. [2025-01-10 06:50:51,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121246 conditions, 58019 events. 32739/58019 cut-off events. For 28367/30045 co-relation queries the response was YES. Maximal size of possible extension queue 3005. Compared 566886 event pairs, 11041 based on Foata normal form. 2201/51096 useless extension candidates. Maximal degree in co-relation 121224. Up to 21214 conditions per place. [2025-01-10 06:50:51,812 INFO L140 encePairwiseOnDemand]: 132/140 looper letters, 239 selfloop transitions, 5 changer transitions 0/291 dead transitions. [2025-01-10 06:50:51,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 291 transitions, 1969 flow [2025-01-10 06:50:51,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2025-01-10 06:50:51,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7214285714285714 [2025-01-10 06:50:51,814 INFO L175 Difference]: Start difference. First operand has 166 places, 218 transitions, 1151 flow. Second operand 4 states and 404 transitions. [2025-01-10 06:50:51,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 291 transitions, 1969 flow [2025-01-10 06:50:51,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 291 transitions, 1954 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-01-10 06:50:51,914 INFO L231 Difference]: Finished difference. Result has 169 places, 220 transitions, 1178 flow [2025-01-10 06:50:51,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1178, PETRI_PLACES=169, PETRI_TRANSITIONS=220} [2025-01-10 06:50:51,914 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 39 predicate places. [2025-01-10 06:50:51,915 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 220 transitions, 1178 flow [2025-01-10 06:50:51,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:51,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:51,918 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-01-10 06:50:51,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:50:51,919 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:50:51,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:51,919 INFO L85 PathProgramCache]: Analyzing trace with hash 138608894, now seen corresponding path program 1 times [2025-01-10 06:50:51,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:51,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393610999] [2025-01-10 06:50:51,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:51,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:51,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 06:50:51,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 06:50:51,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:51,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:50:52,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:52,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393610999] [2025-01-10 06:50:52,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393610999] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:52,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84288328] [2025-01-10 06:50:52,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:52,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:52,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:52,593 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:50:52,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:50:52,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 06:50:52,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 06:50:52,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:52,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:52,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 06:50:52,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:52,735 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-01-10 06:50:52,767 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 23 treesize of output 1 [2025-01-10 06:50:53,042 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:50:53,042 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-01-10 06:50:53,087 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 22 treesize of output 17 [2025-01-10 06:50:53,311 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 06:50:53,311 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 25 treesize of output 12 [2025-01-10 06:50:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:50:53,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:53,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:50:53,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-01-10 06:50:53,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:50:53,508 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 47 treesize of output 39 [2025-01-10 06:50:53,512 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 15 treesize of output 9 [2025-01-10 06:50:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:50:53,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84288328] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:53,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:53,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-01-10 06:50:53,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981883408] [2025-01-10 06:50:53,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:53,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 06:50:53,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:53,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 06:50:53,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=427, Unknown=2, NotChecked=0, Total=506 [2025-01-10 06:50:54,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 140 [2025-01-10 06:50:54,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 220 transitions, 1178 flow. Second operand has 23 states, 23 states have (on average 57.869565217391305) internal successors, (1331), 23 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:54,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:54,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 140 [2025-01-10 06:50:54,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:55,547 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_3~0 4) c_~get_5~0.offset))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_166| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_166|) 0)) (forall ((v_ArrVal_441 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_166| v_ArrVal_441) c_~get_5~0.base) .cse0) 4294967296))))) (<= 0 c_~id_3~0) (forall ((v_ArrVal_441 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_441) c_~get_5~0.base) .cse0) 4294967296))))) is different from false [2025-01-10 06:50:59,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-10 06:51:03,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-10 06:51:11,086 INFO L124 PetriNetUnfolderBase]: 46000/72680 cut-off events. [2025-01-10 06:51:11,086 INFO L125 PetriNetUnfolderBase]: For 33616/36508 co-relation queries the response was YES. [2025-01-10 06:51:11,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164701 conditions, 72680 events. 46000/72680 cut-off events. For 33616/36508 co-relation queries the response was YES. Maximal size of possible extension queue 3187. Compared 621764 event pairs, 12381 based on Foata normal form. 2048/67285 useless extension candidates. Maximal degree in co-relation 164677. Up to 16901 conditions per place. [2025-01-10 06:51:11,649 INFO L140 encePairwiseOnDemand]: 123/140 looper letters, 424 selfloop transitions, 71 changer transitions 0/532 dead transitions. [2025-01-10 06:51:11,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 532 transitions, 3300 flow [2025-01-10 06:51:11,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:51:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:51:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1518 transitions. [2025-01-10 06:51:11,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2025-01-10 06:51:11,651 INFO L175 Difference]: Start difference. First operand has 169 places, 220 transitions, 1178 flow. Second operand 22 states and 1518 transitions. [2025-01-10 06:51:11,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 532 transitions, 3300 flow [2025-01-10 06:51:11,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 532 transitions, 3300 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:51:11,865 INFO L231 Difference]: Finished difference. Result has 191 places, 223 transitions, 1365 flow [2025-01-10 06:51:11,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1365, PETRI_PLACES=191, PETRI_TRANSITIONS=223} [2025-01-10 06:51:11,867 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 61 predicate places. [2025-01-10 06:51:11,867 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 223 transitions, 1365 flow [2025-01-10 06:51:11,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 57.869565217391305) internal successors, (1331), 23 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:11,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:11,868 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, 1] [2025-01-10 06:51:11,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 06:51:12,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:12,069 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-01-10 06:51:12,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:12,069 INFO L85 PathProgramCache]: Analyzing trace with hash 608319514, now seen corresponding path program 1 times [2025-01-10 06:51:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:12,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516172050] [2025-01-10 06:51:12,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:12,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:12,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 06:51:12,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 06:51:12,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:12,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:51:12,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:12,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516172050] [2025-01-10 06:51:12,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516172050] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:12,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579573894] [2025-01-10 06:51:12,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:12,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:12,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:12,417 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:51:12,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:51:12,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 06:51:12,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 06:51:12,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:12,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:12,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 06:51:12,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:12,580 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 23 treesize of output 1 [2025-01-10 06:51:12,865 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 06:51:12,866 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 23 treesize of output 10 [2025-01-10 06:51:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:51:12,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:12,990 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 18 treesize of output 16 [2025-01-10 06:51:12,993 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 22 treesize of output 16 [2025-01-10 06:51:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:51:13,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579573894] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:13,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:13,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-01-10 06:51:13,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748060747] [2025-01-10 06:51:13,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:13,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 06:51:13,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:13,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 06:51:13,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-01-10 06:51:13,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 140 [2025-01-10 06:51:13,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 223 transitions, 1365 flow. Second operand has 17 states, 17 states have (on average 69.3529411764706) internal successors, (1179), 17 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:13,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:13,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 140 [2025-01-10 06:51:13,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand