./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-node-trans.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-trans.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 c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:50:15,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:50:15,444 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:15,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:50:15,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:50:15,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:50:15,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:50:15,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:50:15,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:50:15,466 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:50:15,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:50:15,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:50:15,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:50:15,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:50:15,466 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:50:15,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:50:15,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:50:15,467 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:50:15,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:50:15,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:50:15,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:50:15,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:50:15,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:50:15,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:50:15,467 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:50:15,467 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:50:15,467 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:50:15,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:50:15,468 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:50:15,468 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:50:15,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:50:15,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:50:15,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:50:15,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:50:15,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:50:15,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:50:15,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:50:15,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:50:15,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:50:15,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:50:15,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:50:15,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:50:15,469 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:50:15,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:50:15,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:50:15,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:50:15,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:50:15,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:50:15,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:50:15,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:50:15,469 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 -> c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf [2025-01-10 06:50:15,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:50:15,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:50:15,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:50:15,683 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:50:15,683 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:50:15,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-01-10 06:50:16,953 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6bca85fb/d2657c1d6af2468e82067b589ede4896/FLAG8dc5015ff [2025-01-10 06:50:17,234 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:50:17,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-01-10 06:50:17,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6bca85fb/d2657c1d6af2468e82067b589ede4896/FLAG8dc5015ff [2025-01-10 06:50:17,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6bca85fb/d2657c1d6af2468e82067b589ede4896 [2025-01-10 06:50:17,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:50:17,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:50:17,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:50:17,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:50:17,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:50:17,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:50:17" (1/1) ... [2025-01-10 06:50:17,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408fce61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:17, skipping insertion in model container [2025-01-10 06:50:17,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:50:17" (1/1) ... [2025-01-10 06:50:17,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:50:17,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:50:17,703 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:50:17,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:50:17,744 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:50:17,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:17 WrapperNode [2025-01-10 06:50:17,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:50:17,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:50:17,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:50:17,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:50:17,751 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:17" (1/1) ... [2025-01-10 06:50:17,757 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:17" (1/1) ... [2025-01-10 06:50:17,783 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 474 [2025-01-10 06:50:17,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:50:17,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:50:17,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:50:17,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:50:17,801 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:17" (1/1) ... [2025-01-10 06:50:17,801 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:17" (1/1) ... [2025-01-10 06:50:17,805 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:17" (1/1) ... [2025-01-10 06:50:17,818 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 9, 15]. 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:17,818 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:17" (1/1) ... [2025-01-10 06:50:17,818 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:17" (1/1) ... [2025-01-10 06:50:17,826 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:17" (1/1) ... [2025-01-10 06:50:17,828 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:17" (1/1) ... [2025-01-10 06:50:17,831 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:17" (1/1) ... [2025-01-10 06:50:17,833 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:17" (1/1) ... [2025-01-10 06:50:17,834 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:17" (1/1) ... [2025-01-10 06:50:17,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:50:17,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:50:17,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:50:17,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:50:17,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:17" (1/1) ... [2025-01-10 06:50:17,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:50:17,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:17,874 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:17,877 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:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:50:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:50:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:50:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:50:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:50:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:50:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:50:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:50:17,894 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:50:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:50:17,894 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:50:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:50:17,894 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:50:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:50:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:50:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:50:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:50:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:50:17,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:50:17,895 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:17,986 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:50:17,987 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:50:18,568 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:50:18,572 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:50:18,912 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:50:18,912 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:50:18,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:50:18 BoogieIcfgContainer [2025-01-10 06:50:18,912 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:50:18,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:50:18,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:50:18,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:50:18,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:50:17" (1/3) ... [2025-01-10 06:50:18,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1a019b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:50:18, skipping insertion in model container [2025-01-10 06:50:18,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:17" (2/3) ... [2025-01-10 06:50:18,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1a019b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:50:18, skipping insertion in model container [2025-01-10 06:50:18,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:50:18" (3/3) ... [2025-01-10 06:50:18,919 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2025-01-10 06:50:18,929 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:50:18,930 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-trans.wvr.c that has 4 procedures, 126 locations, 1 initial locations, 6 loop locations, and 42 error locations. [2025-01-10 06:50:18,930 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:50:18,984 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:50:19,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 140 transitions, 301 flow [2025-01-10 06:50:19,037 INFO L124 PetriNetUnfolderBase]: 15/137 cut-off events. [2025-01-10 06:50:19,041 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:50:19,044 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:19,044 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 140 transitions, 301 flow [2025-01-10 06:50:19,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 135 transitions, 285 flow [2025-01-10 06:50:19,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:50:19,059 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;@10eacf2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:50:19,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2025-01-10 06:50:19,061 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:50:19,061 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-01-10 06:50:19,061 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:50:19,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:19,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 06:50:19,062 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:19,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:19,065 INFO L85 PathProgramCache]: Analyzing trace with hash 45670, now seen corresponding path program 1 times [2025-01-10 06:50:19,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:19,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348897499] [2025-01-10 06:50:19,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:19,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:19,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:50:19,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:50:19,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:19,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:19,187 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:19,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:19,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348897499] [2025-01-10 06:50:19,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348897499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:19,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:19,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:19,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260477763] [2025-01-10 06:50:19,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:19,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:19,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:19,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:19,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:19,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:19,228 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:19,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:19,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:19,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:20,087 INFO L124 PetriNetUnfolderBase]: 4133/8026 cut-off events. [2025-01-10 06:50:20,087 INFO L125 PetriNetUnfolderBase]: For 253/253 co-relation queries the response was YES. [2025-01-10 06:50:20,102 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:20,144 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 61 selfloop transitions, 1 changer transitions 0/133 dead transitions. [2025-01-10 06:50:20,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 133 transitions, 405 flow [2025-01-10 06:50:20,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:20,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-01-10 06:50:20,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2025-01-10 06:50:20,155 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:20,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 133 transitions, 405 flow [2025-01-10 06:50:20,161 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:20,164 INFO L231 Difference]: Finished difference. Result has 125 places, 133 transitions, 274 flow [2025-01-10 06:50:20,166 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:20,169 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -5 predicate places. [2025-01-10 06:50:20,169 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 133 transitions, 274 flow [2025-01-10 06:50:20,169 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:20,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:20,169 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:50:20,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:50:20,170 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:20,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1417280, now seen corresponding path program 1 times [2025-01-10 06:50:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:20,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766494207] [2025-01-10 06:50:20,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:20,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:20,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:50:20,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:50:20,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:20,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:20,219 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:20,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:20,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766494207] [2025-01-10 06:50:20,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766494207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:20,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:20,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:20,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304004069] [2025-01-10 06:50:20,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:20,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:20,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:20,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:20,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:20,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:20,231 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:20,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:20,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:20,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:20,898 INFO L124 PetriNetUnfolderBase]: 4133/8024 cut-off events. [2025-01-10 06:50:20,898 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-01-10 06:50:20,906 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:20,928 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 59 selfloop transitions, 1 changer transitions 0/131 dead transitions. [2025-01-10 06:50:20,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 131 transitions, 390 flow [2025-01-10 06:50:20,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:20,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-01-10 06:50:20,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-01-10 06:50:20,930 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:20,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 131 transitions, 390 flow [2025-01-10 06:50:20,931 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:20,932 INFO L231 Difference]: Finished difference. Result has 124 places, 131 transitions, 271 flow [2025-01-10 06:50:20,932 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:20,933 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -6 predicate places. [2025-01-10 06:50:20,933 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 131 transitions, 271 flow [2025-01-10 06:50:20,933 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:20,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:20,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:50:20,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:50:20,933 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:20,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:20,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1362052593, now seen corresponding path program 1 times [2025-01-10 06:50:20,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:20,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538060280] [2025-01-10 06:50:20,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:20,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:20,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:50:20,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:50:20,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:20,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:21,030 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:21,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:21,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538060280] [2025-01-10 06:50:21,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538060280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:21,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:21,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:21,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365268494] [2025-01-10 06:50:21,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:21,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:21,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:21,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:21,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:21,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 06:50:21,047 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:21,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:21,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 06:50:21,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:21,843 INFO L124 PetriNetUnfolderBase]: 4136/8036 cut-off events. [2025-01-10 06:50:21,843 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-01-10 06:50:21,854 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:21,877 INFO L140 encePairwiseOnDemand]: 122/140 looper letters, 63 selfloop transitions, 12 changer transitions 0/140 dead transitions. [2025-01-10 06:50:21,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 140 transitions, 439 flow [2025-01-10 06:50:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2025-01-10 06:50:21,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6589285714285714 [2025-01-10 06:50:21,879 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:21,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 140 transitions, 439 flow [2025-01-10 06:50:21,880 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:21,882 INFO L231 Difference]: Finished difference. Result has 128 places, 140 transitions, 357 flow [2025-01-10 06:50:21,883 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:21,883 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -2 predicate places. [2025-01-10 06:50:21,883 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 140 transitions, 357 flow [2025-01-10 06:50:21,884 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:21,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:21,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:50:21,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:50:21,884 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:21,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:21,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1362052643, now seen corresponding path program 1 times [2025-01-10 06:50:21,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:21,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811242472] [2025-01-10 06:50:21,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:21,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:21,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:50:21,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:50:21,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:21,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:21,938 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:21,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:21,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811242472] [2025-01-10 06:50:21,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811242472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:21,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:21,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:21,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464293260] [2025-01-10 06:50:21,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:21,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:21,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:21,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:21,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:21,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:21,954 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:21,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:21,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:21,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:22,548 INFO L124 PetriNetUnfolderBase]: 4136/8034 cut-off events. [2025-01-10 06:50:22,549 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-01-10 06:50:22,563 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:22,588 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 70 selfloop transitions, 1 changer transitions 0/138 dead transitions. [2025-01-10 06:50:22,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 138 transitions, 495 flow [2025-01-10 06:50:22,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:22,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-01-10 06:50:22,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2025-01-10 06:50:22,590 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:22,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 138 transitions, 495 flow [2025-01-10 06:50:22,591 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:22,593 INFO L231 Difference]: Finished difference. Result has 127 places, 138 transitions, 346 flow [2025-01-10 06:50:22,593 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:22,594 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -3 predicate places. [2025-01-10 06:50:22,594 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 138 transitions, 346 flow [2025-01-10 06:50:22,594 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:22,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:22,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:50:22,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:50:22,594 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:22,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:22,595 INFO L85 PathProgramCache]: Analyzing trace with hash -726039546, now seen corresponding path program 1 times [2025-01-10 06:50:22,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:22,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950760711] [2025-01-10 06:50:22,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:22,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:22,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:50:22,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:50:22,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:22,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:22,676 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:22,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:22,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950760711] [2025-01-10 06:50:22,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950760711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:22,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:22,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:22,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409240795] [2025-01-10 06:50:22,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:22,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:22,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:22,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:22,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:22,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:22,687 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:22,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:22,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:22,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:23,323 INFO L124 PetriNetUnfolderBase]: 4136/8032 cut-off events. [2025-01-10 06:50:23,323 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-01-10 06:50:23,339 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:23,365 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 68 selfloop transitions, 1 changer transitions 0/136 dead transitions. [2025-01-10 06:50:23,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 136 transitions, 480 flow [2025-01-10 06:50:23,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-01-10 06:50:23,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-01-10 06:50:23,367 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:23,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 136 transitions, 480 flow [2025-01-10 06:50:23,368 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:23,369 INFO L231 Difference]: Finished difference. Result has 126 places, 136 transitions, 343 flow [2025-01-10 06:50:23,369 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:23,370 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-01-10 06:50:23,370 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 136 transitions, 343 flow [2025-01-10 06:50:23,370 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:23,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:23,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:23,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:50:23,370 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:23,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:23,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1939256342, now seen corresponding path program 1 times [2025-01-10 06:50:23,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:23,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010565117] [2025-01-10 06:50:23,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:23,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:23,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:50:23,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:50:23,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:23,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:23,426 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:23,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:23,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010565117] [2025-01-10 06:50:23,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010565117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:23,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:23,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:23,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830975122] [2025-01-10 06:50:23,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:23,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:23,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:23,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:23,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:23,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:23,435 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:23,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:23,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:23,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:23,992 INFO L124 PetriNetUnfolderBase]: 4136/8030 cut-off events. [2025-01-10 06:50:23,992 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-01-10 06:50:24,010 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:24,042 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 70 selfloop transitions, 1 changer transitions 0/134 dead transitions. [2025-01-10 06:50:24,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 134 transitions, 481 flow [2025-01-10 06:50:24,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:24,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-01-10 06:50:24,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2025-01-10 06:50:24,045 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:24,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 134 transitions, 481 flow [2025-01-10 06:50:24,047 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:24,049 INFO L231 Difference]: Finished difference. Result has 125 places, 134 transitions, 340 flow [2025-01-10 06:50:24,050 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:24,050 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -5 predicate places. [2025-01-10 06:50:24,051 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 134 transitions, 340 flow [2025-01-10 06:50:24,051 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:24,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:24,052 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:24,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:50:24,052 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:24,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:24,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1940757284, now seen corresponding path program 1 times [2025-01-10 06:50:24,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:24,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897654432] [2025-01-10 06:50:24,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:24,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:24,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:50:24,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:50:24,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:24,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:24,168 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:24,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:24,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897654432] [2025-01-10 06:50:24,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897654432] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:24,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437997070] [2025-01-10 06:50:24,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:24,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:24,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:24,172 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:24,173 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:24,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:50:24,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:50:24,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:24,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:24,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:50:24,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:24,307 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:24,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:50:24,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437997070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:24,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:50:24,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:50:24,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359013449] [2025-01-10 06:50:24,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:24,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:50:24,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:24,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:50:24,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:50:24,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 06:50:24,336 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:24,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:24,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 06:50:24,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:25,028 INFO L124 PetriNetUnfolderBase]: 4136/8027 cut-off events. [2025-01-10 06:50:25,028 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-01-10 06:50:25,043 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:25,069 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 51 selfloop transitions, 21 changer transitions 0/131 dead transitions. [2025-01-10 06:50:25,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 131 transitions, 472 flow [2025-01-10 06:50:25,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:50:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:50:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2025-01-10 06:50:25,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6035714285714285 [2025-01-10 06:50:25,071 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:25,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 131 transitions, 472 flow [2025-01-10 06:50:25,072 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:25,074 INFO L231 Difference]: Finished difference. Result has 126 places, 131 transitions, 369 flow [2025-01-10 06:50:25,074 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:25,074 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-01-10 06:50:25,074 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 131 transitions, 369 flow [2025-01-10 06:50:25,075 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:25,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:25,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:25,084 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:25,279 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:25,279 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:25,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:25,280 INFO L85 PathProgramCache]: Analyzing trace with hash 12597036, now seen corresponding path program 1 times [2025-01-10 06:50:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:25,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317890302] [2025-01-10 06:50:25,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:25,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:25,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:50:25,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:50:25,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:25,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:25,317 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:25,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:25,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317890302] [2025-01-10 06:50:25,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317890302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:25,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:25,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:25,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862402226] [2025-01-10 06:50:25,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:25,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:25,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:25,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:25,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:25,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:25,325 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:25,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:25,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:25,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:25,773 INFO L124 PetriNetUnfolderBase]: 4136/8025 cut-off events. [2025-01-10 06:50:25,773 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-01-10 06:50:25,786 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:25,804 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 68 selfloop transitions, 1 changer transitions 0/129 dead transitions. [2025-01-10 06:50:25,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 129 transitions, 503 flow [2025-01-10 06:50:25,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-01-10 06:50:25,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-01-10 06:50:25,805 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:25,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 129 transitions, 503 flow [2025-01-10 06:50:25,806 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:25,807 INFO L231 Difference]: Finished difference. Result has 122 places, 129 transitions, 322 flow [2025-01-10 06:50:25,808 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:25,808 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -8 predicate places. [2025-01-10 06:50:25,808 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 129 transitions, 322 flow [2025-01-10 06:50:25,808 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:25,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:25,809 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:50:25,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:50:25,809 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:25,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:25,809 INFO L85 PathProgramCache]: Analyzing trace with hash -33932192, now seen corresponding path program 1 times [2025-01-10 06:50:25,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:25,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109536523] [2025-01-10 06:50:25,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:25,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:25,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:50:25,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:50:25,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:25,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:25,863 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:25,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:25,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109536523] [2025-01-10 06:50:25,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109536523] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:25,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928973103] [2025-01-10 06:50:25,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:25,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:25,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:25,866 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:25,870 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:25,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:50:25,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:50:25,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:25,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:25,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:50:25,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:25,950 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:25,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:25,981 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:25,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928973103] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:25,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:25,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:50:25,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438225311] [2025-01-10 06:50:25,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:25,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:50:25,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:25,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:50:25,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:50:26,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 06:50:26,015 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:26,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:26,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 06:50:26,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:26,549 INFO L124 PetriNetUnfolderBase]: 4145/8061 cut-off events. [2025-01-10 06:50:26,549 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-01-10 06:50:26,565 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:26,591 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 60 selfloop transitions, 39 changer transitions 0/156 dead transitions. [2025-01-10 06:50:26,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 156 transitions, 637 flow [2025-01-10 06:50:26,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:50:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:50:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 828 transitions. [2025-01-10 06:50:26,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914285714285714 [2025-01-10 06:50:26,594 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:26,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 156 transitions, 637 flow [2025-01-10 06:50:26,595 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:26,596 INFO L231 Difference]: Finished difference. Result has 133 places, 156 transitions, 570 flow [2025-01-10 06:50:26,597 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:26,597 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-01-10 06:50:26,597 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 156 transitions, 570 flow [2025-01-10 06:50:26,598 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:26,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:26,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:26,604 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:26,798 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:26,799 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:26,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:26,799 INFO L85 PathProgramCache]: Analyzing trace with hash -204637991, now seen corresponding path program 1 times [2025-01-10 06:50:26,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:26,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40274531] [2025-01-10 06:50:26,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:26,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:26,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:50:26,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:50:26,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:26,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:26,901 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:26,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:26,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40274531] [2025-01-10 06:50:26,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40274531] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:26,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:26,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:26,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394305861] [2025-01-10 06:50:26,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:26,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:26,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:26,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:26,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:26,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 06:50:26,916 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:26,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:26,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 06:50:26,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:27,354 INFO L124 PetriNetUnfolderBase]: 4148/8073 cut-off events. [2025-01-10 06:50:27,355 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-01-10 06:50:27,368 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:27,389 INFO L140 encePairwiseOnDemand]: 122/140 looper letters, 99 selfloop transitions, 12 changer transitions 0/165 dead transitions. [2025-01-10 06:50:27,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 165 transitions, 810 flow [2025-01-10 06:50:27,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:27,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:27,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2025-01-10 06:50:27,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6589285714285714 [2025-01-10 06:50:27,393 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:27,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 165 transitions, 810 flow [2025-01-10 06:50:27,394 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:27,395 INFO L231 Difference]: Finished difference. Result has 136 places, 165 transitions, 624 flow [2025-01-10 06:50:27,396 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:27,396 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 6 predicate places. [2025-01-10 06:50:27,396 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 165 transitions, 624 flow [2025-01-10 06:50:27,396 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:27,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:27,397 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:27,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:50:27,397 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:27,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:27,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1810373610, now seen corresponding path program 1 times [2025-01-10 06:50:27,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:27,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110547149] [2025-01-10 06:50:27,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:27,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:27,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:50:27,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:50:27,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:27,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:27,472 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:27,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:27,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110547149] [2025-01-10 06:50:27,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110547149] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:27,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:27,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:27,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771459614] [2025-01-10 06:50:27,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:27,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:27,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:27,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:27,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:27,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:27,482 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:27,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:27,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:27,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:27,945 INFO L124 PetriNetUnfolderBase]: 4147/8072 cut-off events. [2025-01-10 06:50:27,945 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2025-01-10 06:50:27,974 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:28,001 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 101 selfloop transitions, 3 changer transitions 0/164 dead transitions. [2025-01-10 06:50:28,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 164 transitions, 828 flow [2025-01-10 06:50:28,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-01-10 06:50:28,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-01-10 06:50:28,003 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:28,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 164 transitions, 828 flow [2025-01-10 06:50:28,004 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:28,006 INFO L231 Difference]: Finished difference. Result has 138 places, 164 transitions, 617 flow [2025-01-10 06:50:28,006 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:28,006 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 8 predicate places. [2025-01-10 06:50:28,006 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 164 transitions, 617 flow [2025-01-10 06:50:28,007 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:28,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:28,007 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-01-10 06:50:28,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:50:28,007 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:28,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:28,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1342633387, now seen corresponding path program 2 times [2025-01-10 06:50:28,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:28,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574818726] [2025-01-10 06:50:28,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:50:28,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:28,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 06:50:28,019 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:28,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:50:28,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:28,060 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:28,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:28,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574818726] [2025-01-10 06:50:28,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574818726] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:28,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065975747] [2025-01-10 06:50:28,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:50:28,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:28,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:28,064 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:28,067 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:28,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 06:50:28,131 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:28,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:50:28,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:28,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:50:28,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:28,168 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:28,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:28,210 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:28,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065975747] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:28,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:28,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-01-10 06:50:28,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332727966] [2025-01-10 06:50:28,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:28,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:50:28,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:28,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:50:28,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:50:28,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 140 [2025-01-10 06:50:28,248 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:28,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:28,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 140 [2025-01-10 06:50:28,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:28,730 INFO L124 PetriNetUnfolderBase]: 4147/8069 cut-off events. [2025-01-10 06:50:28,730 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2025-01-10 06:50:28,757 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:28,783 INFO L140 encePairwiseOnDemand]: 124/140 looper letters, 56 selfloop transitions, 48 changer transitions 0/161 dead transitions. [2025-01-10 06:50:28,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 161 transitions, 795 flow [2025-01-10 06:50:28,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:50:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:50:28,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 403 transitions. [2025-01-10 06:50:28,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757142857142857 [2025-01-10 06:50:28,784 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:28,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 161 transitions, 795 flow [2025-01-10 06:50:28,786 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:28,788 INFO L231 Difference]: Finished difference. Result has 133 places, 161 transitions, 649 flow [2025-01-10 06:50:28,788 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:28,788 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-01-10 06:50:28,788 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 161 transitions, 649 flow [2025-01-10 06:50:28,789 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:28,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:28,789 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:28,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:50:28,989 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:28,990 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:28,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:28,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2143615617, now seen corresponding path program 1 times [2025-01-10 06:50:28,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:28,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47020860] [2025-01-10 06:50:28,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:28,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:29,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:50:29,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:50:29,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:29,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:29,092 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:29,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:29,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47020860] [2025-01-10 06:50:29,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47020860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:29,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:29,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:29,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949321793] [2025-01-10 06:50:29,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:29,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:29,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:29,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:29,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:29,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:29,102 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:29,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:29,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:29,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:29,596 INFO L124 PetriNetUnfolderBase]: 4146/8068 cut-off events. [2025-01-10 06:50:29,596 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-01-10 06:50:29,608 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:29,625 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 100 selfloop transitions, 3 changer transitions 0/160 dead transitions. [2025-01-10 06:50:29,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 160 transitions, 849 flow [2025-01-10 06:50:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-01-10 06:50:29,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-01-10 06:50:29,627 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:29,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 160 transitions, 849 flow [2025-01-10 06:50:29,629 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:29,630 INFO L231 Difference]: Finished difference. Result has 132 places, 160 transitions, 555 flow [2025-01-10 06:50:29,631 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:29,631 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-01-10 06:50:29,631 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 160 transitions, 555 flow [2025-01-10 06:50:29,632 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:29,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:29,632 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:29,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:50:29,633 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:29,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1040978514, now seen corresponding path program 1 times [2025-01-10 06:50:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:29,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496971467] [2025-01-10 06:50:29,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:29,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 06:50:29,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:50:29,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:29,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:29,722 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:29,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:29,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496971467] [2025-01-10 06:50:29,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496971467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:29,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:29,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:29,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755023048] [2025-01-10 06:50:29,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:29,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:29,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:29,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:29,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:29,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:29,735 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:29,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:29,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:29,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:30,172 INFO L124 PetriNetUnfolderBase]: 4145/8067 cut-off events. [2025-01-10 06:50:30,173 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-01-10 06:50:30,196 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:30,220 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 99 selfloop transitions, 3 changer transitions 0/159 dead transitions. [2025-01-10 06:50:30,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 159 transitions, 755 flow [2025-01-10 06:50:30,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-01-10 06:50:30,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-01-10 06:50:30,222 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:30,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 159 transitions, 755 flow [2025-01-10 06:50:30,224 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:30,225 INFO L231 Difference]: Finished difference. Result has 133 places, 159 transitions, 553 flow [2025-01-10 06:50:30,225 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:30,226 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-01-10 06:50:30,226 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 159 transitions, 553 flow [2025-01-10 06:50:30,226 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:30,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:30,226 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:30,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:50:30,226 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:30,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:30,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1589217077, now seen corresponding path program 1 times [2025-01-10 06:50:30,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:30,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302564525] [2025-01-10 06:50:30,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:30,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:30,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:50:30,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:50:30,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:30,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:30,324 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:30,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:30,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302564525] [2025-01-10 06:50:30,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302564525] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:30,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95536183] [2025-01-10 06:50:30,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:30,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:30,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:30,327 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:30,331 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:30,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:50:30,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:50:30,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:30,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:30,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:50:30,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:30,436 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:30,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:50:30,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95536183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:30,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:50:30,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:50:30,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341902547] [2025-01-10 06:50:30,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:30,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:50:30,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:30,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:50:30,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:50:30,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 06:50:30,459 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:30,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:30,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 06:50:30,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:31,033 INFO L124 PetriNetUnfolderBase]: 4145/8064 cut-off events. [2025-01-10 06:50:31,033 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-01-10 06:50:31,052 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:31,077 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 84 selfloop transitions, 21 changer transitions 0/156 dead transitions. [2025-01-10 06:50:31,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 156 transitions, 751 flow [2025-01-10 06:50:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:50:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:50:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2025-01-10 06:50:31,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6035714285714285 [2025-01-10 06:50:31,079 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:31,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 156 transitions, 751 flow [2025-01-10 06:50:31,080 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:31,083 INFO L231 Difference]: Finished difference. Result has 133 places, 156 transitions, 579 flow [2025-01-10 06:50:31,083 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:31,083 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-01-10 06:50:31,084 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 156 transitions, 579 flow [2025-01-10 06:50:31,084 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:31,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:31,084 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:31,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:50:31,284 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:31,285 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:31,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:31,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2021090562, now seen corresponding path program 1 times [2025-01-10 06:50:31,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:31,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796354250] [2025-01-10 06:50:31,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:31,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:31,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:50:31,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:50:31,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:31,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:31,410 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:31,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:31,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796354250] [2025-01-10 06:50:31,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796354250] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:31,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153049062] [2025-01-10 06:50:31,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:31,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:31,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:31,414 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:31,416 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:31,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:50:31,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:50:31,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:31,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:31,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:50:31,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:31,611 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:31,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:31,640 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:31,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153049062] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:31,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:31,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:50:31,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817786472] [2025-01-10 06:50:31,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:31,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:50:31,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:31,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:50:31,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:50:31,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 06:50:31,671 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:31,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:31,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 06:50:31,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:32,361 INFO L124 PetriNetUnfolderBase]: 4154/8100 cut-off events. [2025-01-10 06:50:32,362 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2025-01-10 06:50:32,385 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:32,409 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 93 selfloop transitions, 39 changer transitions 0/183 dead transitions. [2025-01-10 06:50:32,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 183 transitions, 1005 flow [2025-01-10 06:50:32,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:50:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:50:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 828 transitions. [2025-01-10 06:50:32,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914285714285714 [2025-01-10 06:50:32,412 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:32,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 183 transitions, 1005 flow [2025-01-10 06:50:32,413 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:32,415 INFO L231 Difference]: Finished difference. Result has 141 places, 183 transitions, 783 flow [2025-01-10 06:50:32,415 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:32,415 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 11 predicate places. [2025-01-10 06:50:32,415 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 183 transitions, 783 flow [2025-01-10 06:50:32,416 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:32,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:32,416 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:32,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 06:50:32,620 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:32,620 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:32,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:32,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1918049462, now seen corresponding path program 1 times [2025-01-10 06:50:32,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:32,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143952103] [2025-01-10 06:50:32,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:32,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:32,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 06:50:32,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 06:50:32,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:32,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:32,712 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:32,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:32,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143952103] [2025-01-10 06:50:32,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143952103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:32,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:32,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:32,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884650172] [2025-01-10 06:50:32,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:32,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:32,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:32,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:32,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:32,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 06:50:32,727 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:32,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:32,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 06:50:32,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:33,535 INFO L124 PetriNetUnfolderBase]: 8085/14330 cut-off events. [2025-01-10 06:50:33,536 INFO L125 PetriNetUnfolderBase]: For 209/209 co-relation queries the response was YES. [2025-01-10 06:50:33,599 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:33,646 INFO L140 encePairwiseOnDemand]: 132/140 looper letters, 179 selfloop transitions, 5 changer transitions 0/232 dead transitions. [2025-01-10 06:50:33,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 232 transitions, 1255 flow [2025-01-10 06:50:33,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2025-01-10 06:50:33,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.725 [2025-01-10 06:50:33,648 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:33,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 232 transitions, 1255 flow [2025-01-10 06:50:33,650 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:33,651 INFO L231 Difference]: Finished difference. Result has 144 places, 185 transitions, 784 flow [2025-01-10 06:50:33,652 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:33,652 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 14 predicate places. [2025-01-10 06:50:33,652 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 185 transitions, 784 flow [2025-01-10 06:50:33,652 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:33,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:33,652 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:33,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:50:33,653 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:33,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:33,653 INFO L85 PathProgramCache]: Analyzing trace with hash -670007274, now seen corresponding path program 1 times [2025-01-10 06:50:33,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:33,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735143846] [2025-01-10 06:50:33,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:33,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:33,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:50:33,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:50:33,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:33,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:33,748 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:33,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:33,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735143846] [2025-01-10 06:50:33,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735143846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:33,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:33,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:33,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688079864] [2025-01-10 06:50:33,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:33,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:33,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:33,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:33,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:33,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:33,760 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:33,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:33,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:33,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:34,334 INFO L124 PetriNetUnfolderBase]: 5198/10359 cut-off events. [2025-01-10 06:50:34,334 INFO L125 PetriNetUnfolderBase]: For 1978/2244 co-relation queries the response was YES. [2025-01-10 06:50:34,376 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:34,412 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 127 selfloop transitions, 3 changer transitions 0/184 dead transitions. [2025-01-10 06:50:34,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 184 transitions, 1040 flow [2025-01-10 06:50:34,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-01-10 06:50:34,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-01-10 06:50:34,414 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:34,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 184 transitions, 1040 flow [2025-01-10 06:50:34,424 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:34,426 INFO L231 Difference]: Finished difference. Result has 147 places, 184 transitions, 786 flow [2025-01-10 06:50:34,427 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:34,427 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 17 predicate places. [2025-01-10 06:50:34,427 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 184 transitions, 786 flow [2025-01-10 06:50:34,427 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:34,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:34,428 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:34,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:50:34,428 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:34,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:34,428 INFO L85 PathProgramCache]: Analyzing trace with hash 807328381, now seen corresponding path program 2 times [2025-01-10 06:50:34,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:34,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762190175] [2025-01-10 06:50:34,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:50:34,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:34,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 06:50:34,443 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:34,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:50:34,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:34,493 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:34,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:34,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762190175] [2025-01-10 06:50:34,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762190175] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:34,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980720176] [2025-01-10 06:50:34,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:50:34,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:34,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:34,496 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:34,498 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:34,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 06:50:34,575 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:34,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:50:34,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:34,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:50:34,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:34,621 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:34,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:34,676 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:34,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980720176] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:34,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:34,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 4 [2025-01-10 06:50:34,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397366181] [2025-01-10 06:50:34,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:34,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:50:34,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:34,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:50:34,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:50:34,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 140 [2025-01-10 06:50:34,698 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:34,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:34,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 140 [2025-01-10 06:50:34,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:35,284 INFO L124 PetriNetUnfolderBase]: 5198/10356 cut-off events. [2025-01-10 06:50:35,284 INFO L125 PetriNetUnfolderBase]: For 1994/2260 co-relation queries the response was YES. [2025-01-10 06:50:35,312 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:35,337 INFO L140 encePairwiseOnDemand]: 124/140 looper letters, 82 selfloop transitions, 48 changer transitions 0/181 dead transitions. [2025-01-10 06:50:35,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 181 transitions, 1016 flow [2025-01-10 06:50:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:50:35,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:50:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 403 transitions. [2025-01-10 06:50:35,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757142857142857 [2025-01-10 06:50:35,339 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:35,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 181 transitions, 1016 flow [2025-01-10 06:50:35,348 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:35,350 INFO L231 Difference]: Finished difference. Result has 142 places, 181 transitions, 818 flow [2025-01-10 06:50:35,350 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:35,350 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 12 predicate places. [2025-01-10 06:50:35,350 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 181 transitions, 818 flow [2025-01-10 06:50:35,351 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:35,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:35,351 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:35,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 06:50:35,551 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:35,552 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:35,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:35,553 INFO L85 PathProgramCache]: Analyzing trace with hash -68219877, now seen corresponding path program 1 times [2025-01-10 06:50:35,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:35,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327826099] [2025-01-10 06:50:35,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:35,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:35,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 06:50:35,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 06:50:35,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:35,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:35,638 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:35,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:35,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327826099] [2025-01-10 06:50:35,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327826099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:35,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:35,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:35,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11748540] [2025-01-10 06:50:35,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:35,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:35,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:35,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:35,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:35,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:35,646 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:35,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:35,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:35,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:36,267 INFO L124 PetriNetUnfolderBase]: 5197/10355 cut-off events. [2025-01-10 06:50:36,268 INFO L125 PetriNetUnfolderBase]: For 2002/2268 co-relation queries the response was YES. [2025-01-10 06:50:36,286 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:36,312 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 126 selfloop transitions, 3 changer transitions 0/180 dead transitions. [2025-01-10 06:50:36,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 180 transitions, 1070 flow [2025-01-10 06:50:36,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:36,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-01-10 06:50:36,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-01-10 06:50:36,314 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:36,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 180 transitions, 1070 flow [2025-01-10 06:50:36,329 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:36,330 INFO L231 Difference]: Finished difference. Result has 141 places, 180 transitions, 724 flow [2025-01-10 06:50:36,331 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:36,331 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 11 predicate places. [2025-01-10 06:50:36,332 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 180 transitions, 724 flow [2025-01-10 06:50:36,332 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:36,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:36,332 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:36,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:50:36,332 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:36,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:36,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1980350512, now seen corresponding path program 1 times [2025-01-10 06:50:36,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:36,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971089331] [2025-01-10 06:50:36,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:36,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 06:50:36,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 06:50:36,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:36,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:36,457 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:36,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:36,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971089331] [2025-01-10 06:50:36,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971089331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:36,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:36,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:36,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121656874] [2025-01-10 06:50:36,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:36,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:36,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:36,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:36,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:36,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-01-10 06:50:36,467 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:36,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:36,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-01-10 06:50:36,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:37,045 INFO L124 PetriNetUnfolderBase]: 5196/10354 cut-off events. [2025-01-10 06:50:37,045 INFO L125 PetriNetUnfolderBase]: For 1957/2223 co-relation queries the response was YES. [2025-01-10 06:50:37,084 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:37,122 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 125 selfloop transitions, 3 changer transitions 0/179 dead transitions. [2025-01-10 06:50:37,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 179 transitions, 976 flow [2025-01-10 06:50:37,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-01-10 06:50:37,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-01-10 06:50:37,124 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:37,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 179 transitions, 976 flow [2025-01-10 06:50:37,134 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:37,136 INFO L231 Difference]: Finished difference. Result has 142 places, 179 transitions, 722 flow [2025-01-10 06:50:37,136 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:37,137 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 12 predicate places. [2025-01-10 06:50:37,137 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 179 transitions, 722 flow [2025-01-10 06:50:37,137 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:37,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:37,138 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:37,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:50:37,138 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:37,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:37,138 INFO L85 PathProgramCache]: Analyzing trace with hash 420114226, now seen corresponding path program 1 times [2025-01-10 06:50:37,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:37,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417986047] [2025-01-10 06:50:37,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:37,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:37,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 06:50:37,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 06:50:37,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:37,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:37,802 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:37,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:37,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417986047] [2025-01-10 06:50:37,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417986047] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:37,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323137476] [2025-01-10 06:50:37,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:37,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:37,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:37,806 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:37,808 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:37,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 06:50:37,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 06:50:37,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:37,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:37,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 06:50:37,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:37,956 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:38,003 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:38,165 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:50:38,166 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:38,200 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:38,449 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 06:50:38,450 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:38,467 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:38,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:38,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:50:38,654 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:38,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:50:38,663 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:38,667 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:38,742 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:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323137476] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:38,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:38,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-01-10 06:50:38,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549572523] [2025-01-10 06:50:38,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:38,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 06:50:38,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:38,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 06:50:38,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=417, Unknown=4, NotChecked=0, Total=506 [2025-01-10 06:50:39,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 140 [2025-01-10 06:50:39,904 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:39,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:39,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 140 [2025-01-10 06:50:39,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:45,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:50:50,462 INFO L124 PetriNetUnfolderBase]: 38905/59289 cut-off events. [2025-01-10 06:50:50,463 INFO L125 PetriNetUnfolderBase]: For 5852/6073 co-relation queries the response was YES. [2025-01-10 06:50:50,754 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:51,102 INFO L140 encePairwiseOnDemand]: 123/140 looper letters, 417 selfloop transitions, 72 changer transitions 0/526 dead transitions. [2025-01-10 06:50:51,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 526 transitions, 2905 flow [2025-01-10 06:50:51,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:50:51,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:50:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1531 transitions. [2025-01-10 06:50:51,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49707792207792206 [2025-01-10 06:50:51,106 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:51,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 526 transitions, 2905 flow [2025-01-10 06:50:51,217 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:51,221 INFO L231 Difference]: Finished difference. Result has 166 places, 218 transitions, 1151 flow [2025-01-10 06:50:51,221 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:51,221 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 36 predicate places. [2025-01-10 06:50:51,221 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 218 transitions, 1151 flow [2025-01-10 06:50:51,222 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:51,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:51,222 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,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 06:50:51,422 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:51,423 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:51,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:51,424 INFO L85 PathProgramCache]: Analyzing trace with hash 573812488, now seen corresponding path program 1 times [2025-01-10 06:50:51,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:51,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127874607] [2025-01-10 06:50:51,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:51,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:51,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 06:50:51,452 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,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:51,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:51,519 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:51,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:51,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127874607] [2025-01-10 06:50:51,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127874607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:51,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:51,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:51,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857276279] [2025-01-10 06:50:51,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:51,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:51,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:51,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:51,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:51,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 06:50:51,537 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:51,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:51,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 06:50:51,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:56,096 INFO L124 PetriNetUnfolderBase]: 32739/58019 cut-off events. [2025-01-10 06:50:56,096 INFO L125 PetriNetUnfolderBase]: For 28367/30045 co-relation queries the response was YES. [2025-01-10 06:50:56,443 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:56,689 INFO L140 encePairwiseOnDemand]: 132/140 looper letters, 239 selfloop transitions, 5 changer transitions 0/291 dead transitions. [2025-01-10 06:50:56,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 291 transitions, 1969 flow [2025-01-10 06:50:56,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2025-01-10 06:50:56,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7214285714285714 [2025-01-10 06:50:56,691 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:56,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 291 transitions, 1969 flow [2025-01-10 06:50:56,867 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:56,874 INFO L231 Difference]: Finished difference. Result has 169 places, 220 transitions, 1178 flow [2025-01-10 06:50:56,874 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:56,874 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 39 predicate places. [2025-01-10 06:50:56,874 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 220 transitions, 1178 flow [2025-01-10 06:50:56,875 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:56,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:56,875 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:56,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:50:56,875 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:56,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:56,875 INFO L85 PathProgramCache]: Analyzing trace with hash 138608894, now seen corresponding path program 1 times [2025-01-10 06:50:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:56,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564448528] [2025-01-10 06:50:56,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:56,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:56,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 06:50:56,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 06:50:56,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:56,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:57,805 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:57,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:57,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564448528] [2025-01-10 06:50:57,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564448528] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:57,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589337063] [2025-01-10 06:50:57,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:57,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:57,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:57,810 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:57,811 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:57,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 06:50:57,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 06:50:57,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:57,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:57,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 06:50:57,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:58,015 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:58,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 06:50:58,163 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:50:58,164 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:58,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:50:58,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 06:50:58,334 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:58,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:58,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:50:58,536 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:58,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:50:58,544 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:58,549 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:58,608 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:58,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589337063] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:58,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:58,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-01-10 06:50:58,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536125026] [2025-01-10 06:50:58,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:58,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 06:50:58,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:58,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 06:50:58,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=280, Unknown=3, NotChecked=0, Total=342 [2025-01-10 06:50:58,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 140 [2025-01-10 06:50:58,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 220 transitions, 1178 flow. Second operand has 19 states, 19 states have (on average 57.578947368421055) internal successors, (1094), 19 states have internal predecessors, (1094), 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:58,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:58,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 140 [2025-01-10 06:50:58,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:00,080 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_3~0 4) c_~get_5~0.offset))) (and (forall ((v_ArrVal_441 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_441) c_~get_5~0.base) .cse0) 4294967296))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_166| Int)) (or (forall ((v_ArrVal_441 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_166| v_ArrVal_441) c_~get_5~0.base) .cse0) 4294967296))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_166|) 0)))) (<= 0 c_~id_3~0))) is different from false [2025-01-10 06:51:04,128 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:51:10,375 INFO L124 PetriNetUnfolderBase]: 46000/72680 cut-off events. [2025-01-10 06:51:10,375 INFO L125 PetriNetUnfolderBase]: For 33616/36508 co-relation queries the response was YES. [2025-01-10 06:51:10,847 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 621422 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,175 INFO L140 encePairwiseOnDemand]: 123/140 looper letters, 424 selfloop transitions, 71 changer transitions 0/532 dead transitions. [2025-01-10 06:51:11,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 532 transitions, 3300 flow [2025-01-10 06:51:11,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:51:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:51:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1518 transitions. [2025-01-10 06:51:11,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2025-01-10 06:51:11,178 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,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 532 transitions, 3300 flow [2025-01-10 06:51:11,409 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,413 INFO L231 Difference]: Finished difference. Result has 191 places, 223 transitions, 1365 flow [2025-01-10 06:51:11,413 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,414 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 61 predicate places. [2025-01-10 06:51:11,414 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 223 transitions, 1365 flow [2025-01-10 06:51:11,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 57.578947368421055) internal successors, (1094), 19 states have internal predecessors, (1094), 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,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:11,415 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,421 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:11,619 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:11,619 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:11,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:11,619 INFO L85 PathProgramCache]: Analyzing trace with hash 608319514, now seen corresponding path program 1 times [2025-01-10 06:51:11,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:11,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224158434] [2025-01-10 06:51:11,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:11,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:11,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 06:51:11,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 06:51:11,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:11,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:12,453 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,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:12,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224158434] [2025-01-10 06:51:12,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224158434] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:12,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493157359] [2025-01-10 06:51:12,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:12,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:12,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:12,457 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,462 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,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 06:51:12,576 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,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:12,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:12,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 06:51:12,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:12,661 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,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 06:51:12,889 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,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:12,991 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,994 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,060 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,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493157359] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:13,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:13,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 16 [2025-01-10 06:51:13,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657618308] [2025-01-10 06:51:13,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:13,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 06:51:13,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:13,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 06:51:13,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-01-10 06:51:13,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 140 [2025-01-10 06:51:13,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 223 transitions, 1365 flow. Second operand has 18 states, 18 states have (on average 69.16666666666667) internal successors, (1245), 18 states have internal predecessors, (1245), 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,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:13,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 140 [2025-01-10 06:51:13,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand