./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/realpath-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/busybox-1.22.0/realpath-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 05679b26723da7fefe43df743638bd07f7ab18e951e1a83e76570c1072d39492 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:03:59,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:03:59,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 06:03:59,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:03:59,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:03:59,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:03:59,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:03:59,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:03:59,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:03:59,750 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:03:59,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:03:59,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:03:59,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:03:59,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:03:59,751 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:03:59,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:03:59,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:03:59,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:03:59,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:03:59,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:03:59,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:03:59,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:03:59,752 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:03:59,752 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:03:59,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:03:59,752 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:03:59,752 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:03:59,752 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:03:59,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:03:59,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:03:59,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:03:59,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:03:59,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:03:59,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:03:59,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:03:59,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:03:59,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:03:59,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:03:59,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:03:59,754 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:03:59,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:03:59,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:03:59,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:03:59,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:03:59,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:03:59,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:03:59,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:03:59,754 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 05679b26723da7fefe43df743638bd07f7ab18e951e1a83e76570c1072d39492 [2025-01-10 06:04:00,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:04:00,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:04:00,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:04:00,095 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:04:00,095 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:04:00,097 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/realpath-1.i [2025-01-10 06:04:01,534 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cffeab193/acc198ff91524eff89cbca3a5aef9c9c/FLAGc3be39494 [2025-01-10 06:04:02,050 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:04:02,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/realpath-1.i [2025-01-10 06:04:02,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cffeab193/acc198ff91524eff89cbca3a5aef9c9c/FLAGc3be39494 [2025-01-10 06:04:02,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cffeab193/acc198ff91524eff89cbca3a5aef9c9c [2025-01-10 06:04:02,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:04:02,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:04:02,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:04:02,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:04:02,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:04:02,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:04:02" (1/1) ... [2025-01-10 06:04:02,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d9cf6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:02, skipping insertion in model container [2025-01-10 06:04:02,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:04:02" (1/1) ... [2025-01-10 06:04:02,193 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:04:02,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:04:02,998 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:04:03,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:04:03,268 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 06:04:03,274 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:04:03,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:03 WrapperNode [2025-01-10 06:04:03,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:04:03,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:04:03,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:04:03,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:04:03,282 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:04:03" (1/1) ... [2025-01-10 06:04:03,314 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:04:03" (1/1) ... [2025-01-10 06:04:03,377 INFO L138 Inliner]: procedures = 600, calls = 515, calls flagged for inlining = 18, calls inlined = 15, statements flattened = 830 [2025-01-10 06:04:03,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:04:03,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:04:03,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:04:03,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:04:03,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:03" (1/1) ... [2025-01-10 06:04:03,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:03" (1/1) ... [2025-01-10 06:04:03,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:03" (1/1) ... [2025-01-10 06:04:03,430 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 06:04:03,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:03" (1/1) ... [2025-01-10 06:04:03,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:03" (1/1) ... [2025-01-10 06:04:03,476 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:03" (1/1) ... [2025-01-10 06:04:03,485 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:03" (1/1) ... [2025-01-10 06:04:03,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:03" (1/1) ... [2025-01-10 06:04:03,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:03" (1/1) ... [2025-01-10 06:04:03,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:03" (1/1) ... [2025-01-10 06:04:03,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:04:03,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:04:03,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:04:03,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:04:03,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:03" (1/1) ... [2025-01-10 06:04:03,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:04:03,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:03,554 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:04:03,559 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:04:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:04:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-10 06:04:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-01-10 06:04:03,576 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-01-10 06:04:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-10 06:04:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-10 06:04:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:04:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:04:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 06:04:03,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:04:03,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:04:03,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 06:04:03,577 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 06:04:03,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 06:04:03,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 06:04:03,577 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 06:04:03,577 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 06:04:03,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:04:03,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 06:04:03,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-10 06:04:03,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-10 06:04:03,957 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:04:03,959 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:04:05,147 INFO L? ?]: Removed 220 outVars from TransFormulas that were not future-live. [2025-01-10 06:04:05,149 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:04:05,165 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:04:05,166 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2025-01-10 06:04:05,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:04:05 BoogieIcfgContainer [2025-01-10 06:04:05,166 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:04:05,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:04:05,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:04:05,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:04:05,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:04:02" (1/3) ... [2025-01-10 06:04:05,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569acd30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:04:05, skipping insertion in model container [2025-01-10 06:04:05,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:03" (2/3) ... [2025-01-10 06:04:05,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569acd30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:04:05, skipping insertion in model container [2025-01-10 06:04:05,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:04:05" (3/3) ... [2025-01-10 06:04:05,189 INFO L128 eAbstractionObserver]: Analyzing ICFG realpath-1.i [2025-01-10 06:04:05,203 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:04:05,205 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG realpath-1.i that has 4 procedures, 150 locations, 1 initial locations, 13 loop locations, and 33 error locations. [2025-01-10 06:04:05,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:04:05,276 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;@5da8f2db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:04:05,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-01-10 06:04:05,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 106 states have (on average 1.669811320754717) internal successors, (177), 139 states have internal predecessors, (177), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 06:04:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 06:04:05,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:05,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 06:04:05,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:05,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:05,292 INFO L85 PathProgramCache]: Analyzing trace with hash 7636548, now seen corresponding path program 1 times [2025-01-10 06:04:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:05,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792573141] [2025-01-10 06:04:05,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:05,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:05,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:04:05,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:04:05,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:05,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:06,176 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:04:06,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:06,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792573141] [2025-01-10 06:04:06,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792573141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:06,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:06,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:06,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098039723] [2025-01-10 06:04:06,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:06,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:06,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:06,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:06,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:06,204 INFO L87 Difference]: Start difference. First operand has 150 states, 106 states have (on average 1.669811320754717) internal successors, (177), 139 states have internal predecessors, (177), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:04:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:06,273 INFO L93 Difference]: Finished difference Result 215 states and 276 transitions. [2025-01-10 06:04:06,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:06,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 06:04:06,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:06,284 INFO L225 Difference]: With dead ends: 215 [2025-01-10 06:04:06,285 INFO L226 Difference]: Without dead ends: 67 [2025-01-10 06:04:06,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:06,295 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:06,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 145 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:06,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-10 06:04:06,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-10 06:04:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.5) internal successors, (72), 61 states have internal predecessors, (72), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2025-01-10 06:04:06,343 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 4 [2025-01-10 06:04:06,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:06,343 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2025-01-10 06:04:06,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:04:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2025-01-10 06:04:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 06:04:06,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:06,344 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 06:04:06,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:04:06,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:06,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:06,347 INFO L85 PathProgramCache]: Analyzing trace with hash -132609152, now seen corresponding path program 1 times [2025-01-10 06:04:06,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:06,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171089655] [2025-01-10 06:04:06,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:06,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:06,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:04:06,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:04:06,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:06,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:06,844 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:04:06,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:06,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171089655] [2025-01-10 06:04:06,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171089655] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:06,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340315658] [2025-01-10 06:04:06,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:06,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:06,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:06,849 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:04:06,851 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:04:07,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:04:07,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:04:07,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:07,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:07,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:07,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:07,389 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:04:07,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:07,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340315658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:07,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:04:07,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:04:07,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908665500] [2025-01-10 06:04:07,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:07,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:04:07,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:07,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:04:07,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:07,394 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 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:04:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:07,427 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2025-01-10 06:04:07,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:04:07,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 06:04:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:07,428 INFO L225 Difference]: With dead ends: 67 [2025-01-10 06:04:07,429 INFO L226 Difference]: Without dead ends: 66 [2025-01-10 06:04:07,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:07,430 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:07,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 137 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-10 06:04:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-10 06:04:07,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 60 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2025-01-10 06:04:07,439 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 7 [2025-01-10 06:04:07,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:07,441 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2025-01-10 06:04:07,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 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:04:07,441 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2025-01-10 06:04:07,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:04:07,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:07,442 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 06:04:07,456 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:04:07,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:07,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:07,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:07,643 INFO L85 PathProgramCache]: Analyzing trace with hash 184083842, now seen corresponding path program 1 times [2025-01-10 06:04:07,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:07,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117966375] [2025-01-10 06:04:07,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:07,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:07,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:04:07,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:04:07,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:07,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:04:07,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:07,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117966375] [2025-01-10 06:04:07,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117966375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:07,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:07,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:07,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582902667] [2025-01-10 06:04:07,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:07,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:07,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:07,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:07,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:07,975 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 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:04:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:07,996 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-01-10 06:04:07,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:07,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 06:04:07,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:07,998 INFO L225 Difference]: With dead ends: 66 [2025-01-10 06:04:07,998 INFO L226 Difference]: Without dead ends: 65 [2025-01-10 06:04:07,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:08,000 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:08,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:08,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-10 06:04:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2025-01-10 06:04:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 57 states have internal predecessors, (68), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:08,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2025-01-10 06:04:08,011 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 8 [2025-01-10 06:04:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:08,012 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2025-01-10 06:04:08,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 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:04:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2025-01-10 06:04:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 06:04:08,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:08,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:08,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:04:08,013 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:08,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1973967156, now seen corresponding path program 1 times [2025-01-10 06:04:08,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:08,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313076330] [2025-01-10 06:04:08,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:08,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:08,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:04:08,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:04:08,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:08,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:08,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:08,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313076330] [2025-01-10 06:04:08,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313076330] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:08,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50625589] [2025-01-10 06:04:08,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:08,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:08,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:08,403 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:04:08,405 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:04:08,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:04:08,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:04:08,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:08,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:08,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:04:08,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:04:08,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:08,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50625589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:08,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:04:08,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 06:04:08,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944463108] [2025-01-10 06:04:08,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:08,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:08,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:08,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:08,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:08,907 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:08,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:08,939 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2025-01-10 06:04:08,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:08,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-01-10 06:04:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:08,943 INFO L225 Difference]: With dead ends: 63 [2025-01-10 06:04:08,943 INFO L226 Difference]: Without dead ends: 61 [2025-01-10 06:04:08,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:08,944 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 46 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:08,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 80 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-10 06:04:08,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-10 06:04:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.434782608695652) internal successors, (66), 55 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-01-10 06:04:08,951 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 12 [2025-01-10 06:04:08,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:08,952 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-01-10 06:04:08,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:08,952 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2025-01-10 06:04:08,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 06:04:08,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:08,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:08,964 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:04:09,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:09,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:09,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:09,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1063439957, now seen corresponding path program 1 times [2025-01-10 06:04:09,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:09,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907831115] [2025-01-10 06:04:09,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:09,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:09,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:04:09,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:04:09,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:09,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:09,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:09,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:09,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907831115] [2025-01-10 06:04:09,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907831115] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:09,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188706570] [2025-01-10 06:04:09,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:09,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:09,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:09,499 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:04:09,502 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:04:09,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:04:09,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:04:09,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:09,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:09,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:09,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:10,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:10,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188706570] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:10,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:10,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:04:10,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621730600] [2025-01-10 06:04:10,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:10,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:04:10,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:10,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:04:10,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:10,037 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:10,067 INFO L93 Difference]: Finished difference Result 125 states and 149 transitions. [2025-01-10 06:04:10,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:10,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-01-10 06:04:10,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:10,068 INFO L225 Difference]: With dead ends: 125 [2025-01-10 06:04:10,068 INFO L226 Difference]: Without dead ends: 70 [2025-01-10 06:04:10,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:10,069 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:10,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 134 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:10,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-10 06:04:10,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-10 06:04:10,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 64 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2025-01-10 06:04:10,075 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 13 [2025-01-10 06:04:10,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:10,076 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2025-01-10 06:04:10,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2025-01-10 06:04:10,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 06:04:10,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:10,076 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:10,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:04:10,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:10,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:10,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:10,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1803965209, now seen corresponding path program 2 times [2025-01-10 06:04:10,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:10,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388724897] [2025-01-10 06:04:10,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:04:10,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:10,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 06:04:10,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-01-10 06:04:10,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:04:10,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:04:10,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:10,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388724897] [2025-01-10 06:04:10,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388724897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:10,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:10,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:04:10,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523093809] [2025-01-10 06:04:10,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:10,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:04:10,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:10,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:04:10,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:10,759 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:10,808 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2025-01-10 06:04:10,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:04:10,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-10 06:04:10,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:10,809 INFO L225 Difference]: With dead ends: 70 [2025-01-10 06:04:10,809 INFO L226 Difference]: Without dead ends: 68 [2025-01-10 06:04:10,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:10,810 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 45 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:10,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 187 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-10 06:04:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-10 06:04:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 62 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2025-01-10 06:04:10,816 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 22 [2025-01-10 06:04:10,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:10,816 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2025-01-10 06:04:10,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2025-01-10 06:04:10,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 06:04:10,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:10,817 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:10,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:04:10,817 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:10,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:10,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1269849256, now seen corresponding path program 1 times [2025-01-10 06:04:10,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:10,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800260188] [2025-01-10 06:04:10,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:10,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:10,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:04:10,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:04:10,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:10,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:04:11,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:11,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800260188] [2025-01-10 06:04:11,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800260188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:11,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:11,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866492802] [2025-01-10 06:04:11,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:11,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:11,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:11,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:11,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:11,159 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:11,184 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2025-01-10 06:04:11,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:11,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-01-10 06:04:11,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:11,187 INFO L225 Difference]: With dead ends: 119 [2025-01-10 06:04:11,188 INFO L226 Difference]: Without dead ends: 71 [2025-01-10 06:04:11,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:11,189 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:11,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:11,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-10 06:04:11,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-01-10 06:04:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 65 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2025-01-10 06:04:11,201 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 27 [2025-01-10 06:04:11,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:11,201 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2025-01-10 06:04:11,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:11,202 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2025-01-10 06:04:11,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 06:04:11,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:11,203 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:11,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:04:11,203 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:11,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:11,204 INFO L85 PathProgramCache]: Analyzing trace with hash -539112246, now seen corresponding path program 1 times [2025-01-10 06:04:11,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:11,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436168048] [2025-01-10 06:04:11,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:11,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:11,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 06:04:11,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 06:04:11,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:11,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:04:11,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:11,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436168048] [2025-01-10 06:04:11,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436168048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:11,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:11,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:11,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123378007] [2025-01-10 06:04:11,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:11,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:11,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:11,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:11,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:11,526 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:11,545 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2025-01-10 06:04:11,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:11,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-01-10 06:04:11,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:11,548 INFO L225 Difference]: With dead ends: 76 [2025-01-10 06:04:11,548 INFO L226 Difference]: Without dead ends: 74 [2025-01-10 06:04:11,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:11,549 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:11,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 128 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:11,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-10 06:04:11,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-10 06:04:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 68 states have internal predecessors, (79), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2025-01-10 06:04:11,559 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 29 [2025-01-10 06:04:11,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:11,559 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2025-01-10 06:04:11,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2025-01-10 06:04:11,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:04:11,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:11,562 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:11,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:04:11,563 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:11,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:11,563 INFO L85 PathProgramCache]: Analyzing trace with hash -6963421, now seen corresponding path program 1 times [2025-01-10 06:04:11,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:11,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670824997] [2025-01-10 06:04:11,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:11,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:11,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:04:11,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:04:11,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:11,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:04:11,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:11,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670824997] [2025-01-10 06:04:11,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670824997] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:11,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430155518] [2025-01-10 06:04:11,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:11,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:11,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:11,941 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:04:11,944 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:04:12,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:04:12,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:04:12,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:12,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:12,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 1286 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:04:12,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:04:12,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:04:12,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430155518] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:12,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:12,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:04:12,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044839719] [2025-01-10 06:04:12,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:12,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:04:12,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:12,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:04:12,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:04:12,706 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:04:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:12,814 INFO L93 Difference]: Finished difference Result 150 states and 178 transitions. [2025-01-10 06:04:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:04:12,815 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-01-10 06:04:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:12,815 INFO L225 Difference]: With dead ends: 150 [2025-01-10 06:04:12,816 INFO L226 Difference]: Without dead ends: 91 [2025-01-10 06:04:12,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:04:12,816 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 5 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:12,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 350 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-10 06:04:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-10 06:04:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.2151898734177216) internal successors, (96), 85 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2025-01-10 06:04:12,824 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 30 [2025-01-10 06:04:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:12,825 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2025-01-10 06:04:12,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:04:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2025-01-10 06:04:12,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 06:04:12,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:12,826 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:12,838 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:04:13,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-10 06:04:13,030 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:13,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:13,031 INFO L85 PathProgramCache]: Analyzing trace with hash 456340323, now seen corresponding path program 1 times [2025-01-10 06:04:13,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:13,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490091959] [2025-01-10 06:04:13,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:13,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:13,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 06:04:13,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:04:13,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:13,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:04:13,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:13,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490091959] [2025-01-10 06:04:13,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490091959] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:13,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:13,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:13,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13839612] [2025-01-10 06:04:13,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:13,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:13,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:13,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:13,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:13,417 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:13,455 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2025-01-10 06:04:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:13,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-01-10 06:04:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:13,457 INFO L225 Difference]: With dead ends: 103 [2025-01-10 06:04:13,457 INFO L226 Difference]: Without dead ends: 101 [2025-01-10 06:04:13,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:13,457 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:13,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 122 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-10 06:04:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-01-10 06:04:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 94 states have internal predecessors, (108), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2025-01-10 06:04:13,465 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 48 [2025-01-10 06:04:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:13,465 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2025-01-10 06:04:13,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2025-01-10 06:04:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 06:04:13,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:13,467 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:13,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:04:13,467 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:13,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:13,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1261642454, now seen corresponding path program 1 times [2025-01-10 06:04:13,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:13,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324167394] [2025-01-10 06:04:13,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:13,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:13,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 06:04:13,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 06:04:13,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:13,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:04:13,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:13,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324167394] [2025-01-10 06:04:13,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324167394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:13,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:13,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:13,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546133631] [2025-01-10 06:04:13,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:13,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:13,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:13,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:13,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:13,788 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:13,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:13,805 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2025-01-10 06:04:13,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:13,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-01-10 06:04:13,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:13,808 INFO L225 Difference]: With dead ends: 100 [2025-01-10 06:04:13,808 INFO L226 Difference]: Without dead ends: 99 [2025-01-10 06:04:13,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:13,808 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:13,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:13,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-10 06:04:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2025-01-10 06:04:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 89 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2025-01-10 06:04:13,821 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 49 [2025-01-10 06:04:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:13,821 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2025-01-10 06:04:13,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2025-01-10 06:04:13,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 06:04:13,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:13,826 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:13,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:04:13,826 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:13,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:13,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1043244454, now seen corresponding path program 1 times [2025-01-10 06:04:13,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:13,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479645547] [2025-01-10 06:04:13,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:13,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:13,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:04:13,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:04:13,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:13,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:14,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:14,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479645547] [2025-01-10 06:04:14,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479645547] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:14,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203610263] [2025-01-10 06:04:14,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:14,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:14,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:14,143 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:04:14,145 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:04:14,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:04:14,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:04:14,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:14,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:14,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:04:14,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:04:14,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:14,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203610263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:14,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:04:14,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-01-10 06:04:14,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040568719] [2025-01-10 06:04:14,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:14,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:04:14,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:14,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:04:14,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:14,789 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:14,849 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2025-01-10 06:04:14,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:04:14,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-01-10 06:04:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:14,851 INFO L225 Difference]: With dead ends: 124 [2025-01-10 06:04:14,851 INFO L226 Difference]: Without dead ends: 115 [2025-01-10 06:04:14,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:14,852 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 29 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:14,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 207 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:14,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-10 06:04:14,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2025-01-10 06:04:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 90 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2025-01-10 06:04:14,860 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 50 [2025-01-10 06:04:14,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:14,860 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2025-01-10 06:04:14,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2025-01-10 06:04:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-10 06:04:14,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:14,861 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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:04:14,875 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:04:15,062 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,SelfDestructingSolverStorable11 [2025-01-10 06:04:15,062 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:15,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:15,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1209535908, now seen corresponding path program 1 times [2025-01-10 06:04:15,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:15,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712905359] [2025-01-10 06:04:15,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:15,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:15,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 06:04:15,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 06:04:15,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:15,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:15,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:15,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712905359] [2025-01-10 06:04:15,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712905359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:15,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:15,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:04:15,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749451762] [2025-01-10 06:04:15,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:15,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:04:15,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:15,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:04:15,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:15,604 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:15,637 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2025-01-10 06:04:15,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:04:15,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-01-10 06:04:15,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:15,638 INFO L225 Difference]: With dead ends: 130 [2025-01-10 06:04:15,639 INFO L226 Difference]: Without dead ends: 99 [2025-01-10 06:04:15,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:15,640 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:15,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-10 06:04:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-10 06:04:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 88 states have (on average 1.2045454545454546) internal successors, (106), 93 states have internal predecessors, (106), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:15,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2025-01-10 06:04:15,650 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 52 [2025-01-10 06:04:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:15,650 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2025-01-10 06:04:15,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2025-01-10 06:04:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 06:04:15,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:15,654 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 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:04:15,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:04:15,654 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:15,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:15,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1615701933, now seen corresponding path program 1 times [2025-01-10 06:04:15,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:15,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34295360] [2025-01-10 06:04:15,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:15,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:15,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 06:04:15,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 06:04:15,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:15,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:16,063 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:16,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:16,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34295360] [2025-01-10 06:04:16,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34295360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:16,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:16,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:04:16,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695034819] [2025-01-10 06:04:16,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:16,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:04:16,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:16,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:04:16,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:16,066 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:16,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:16,090 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2025-01-10 06:04:16,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:04:16,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-01-10 06:04:16,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:16,091 INFO L225 Difference]: With dead ends: 102 [2025-01-10 06:04:16,092 INFO L226 Difference]: Without dead ends: 99 [2025-01-10 06:04:16,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:16,093 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 17 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:16,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 231 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:16,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-10 06:04:16,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-10 06:04:16,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 93 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2025-01-10 06:04:16,101 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 56 [2025-01-10 06:04:16,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:16,101 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2025-01-10 06:04:16,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2025-01-10 06:04:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 06:04:16,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:16,103 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 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:04:16,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:04:16,103 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:16,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:16,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1615703855, now seen corresponding path program 1 times [2025-01-10 06:04:16,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:16,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809817894] [2025-01-10 06:04:16,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:16,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:16,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 06:04:16,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 06:04:16,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:16,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:16,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:16,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809817894] [2025-01-10 06:04:16,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809817894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:16,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:16,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:04:16,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819112578] [2025-01-10 06:04:16,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:16,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:04:16,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:16,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:04:16,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:16,621 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:16,703 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2025-01-10 06:04:16,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:16,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-01-10 06:04:16,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:16,705 INFO L225 Difference]: With dead ends: 133 [2025-01-10 06:04:16,705 INFO L226 Difference]: Without dead ends: 98 [2025-01-10 06:04:16,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:16,705 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 47 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:16,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 216 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:16,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-10 06:04:16,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-10 06:04:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 92 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2025-01-10 06:04:16,713 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 56 [2025-01-10 06:04:16,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:16,714 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2025-01-10 06:04:16,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2025-01-10 06:04:16,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 06:04:16,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:16,714 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:16,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:04:16,715 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:16,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:16,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1389643004, now seen corresponding path program 1 times [2025-01-10 06:04:16,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:16,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187824282] [2025-01-10 06:04:16,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:16,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:16,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:04:16,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:04:16,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:16,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:04:17,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:17,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187824282] [2025-01-10 06:04:17,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187824282] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:17,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49900188] [2025-01-10 06:04:17,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:17,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:17,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:17,011 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:04:17,014 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:04:17,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:04:17,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:04:17,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:17,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:17,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:17,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:04:17,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:04:17,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49900188] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:17,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:17,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:04:17,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954753245] [2025-01-10 06:04:17,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:17,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:04:17,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:17,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:04:17,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:17,722 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:17,757 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2025-01-10 06:04:17,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:17,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-01-10 06:04:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:17,758 INFO L225 Difference]: With dead ends: 171 [2025-01-10 06:04:17,758 INFO L226 Difference]: Without dead ends: 116 [2025-01-10 06:04:17,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:17,759 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:17,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 243 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:17,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-10 06:04:17,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-01-10 06:04:17,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 110 states have internal predecessors, (121), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2025-01-10 06:04:17,768 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 55 [2025-01-10 06:04:17,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:17,768 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2025-01-10 06:04:17,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:17,769 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2025-01-10 06:04:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 06:04:17,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:17,769 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 2, 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:04:17,782 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:04:17,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 06:04:17,973 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:17,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:17,974 INFO L85 PathProgramCache]: Analyzing trace with hash 891746098, now seen corresponding path program 1 times [2025-01-10 06:04:17,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:17,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625082753] [2025-01-10 06:04:17,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:17,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:18,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 06:04:18,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 06:04:18,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:18,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-01-10 06:04:18,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:18,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625082753] [2025-01-10 06:04:18,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625082753] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:18,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968546493] [2025-01-10 06:04:18,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:18,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:18,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:18,318 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:04:18,320 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:04:18,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 06:04:18,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 06:04:18,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:18,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:18,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 1506 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:04:18,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:04:19,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:19,131 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:04:19,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968546493] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:19,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:19,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:04:19,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939166291] [2025-01-10 06:04:19,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:19,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:04:19,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:19,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:04:19,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:04:19,134 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:19,249 INFO L93 Difference]: Finished difference Result 215 states and 247 transitions. [2025-01-10 06:04:19,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:04:19,250 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2025-01-10 06:04:19,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:19,251 INFO L225 Difference]: With dead ends: 215 [2025-01-10 06:04:19,251 INFO L226 Difference]: Without dead ends: 151 [2025-01-10 06:04:19,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:04:19,254 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 5 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:19,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 390 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:19,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-10 06:04:19,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-01-10 06:04:19,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 141 states have (on average 1.1063829787234043) internal successors, (156), 145 states have internal predecessors, (156), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2025-01-10 06:04:19,267 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 66 [2025-01-10 06:04:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:19,268 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2025-01-10 06:04:19,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2025-01-10 06:04:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 06:04:19,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:19,270 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 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:04:19,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:04:19,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:19,471 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:19,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:19,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1112848604, now seen corresponding path program 1 times [2025-01-10 06:04:19,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:19,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449328057] [2025-01-10 06:04:19,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:19,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:19,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 06:04:19,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 06:04:19,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:19,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:19,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:19,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449328057] [2025-01-10 06:04:19,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449328057] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:19,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253632462] [2025-01-10 06:04:19,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:19,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:19,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:19,884 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:04:19,886 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:04:20,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 06:04:20,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 06:04:20,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:20,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:20,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 1645 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:20,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:20,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:20,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253632462] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:20,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:20,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 06:04:20,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630546327] [2025-01-10 06:04:20,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:20,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:04:20,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:20,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:04:20,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:20,682 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:20,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:20,728 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2025-01-10 06:04:20,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:20,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2025-01-10 06:04:20,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:20,731 INFO L225 Difference]: With dead ends: 161 [2025-01-10 06:04:20,731 INFO L226 Difference]: Without dead ends: 160 [2025-01-10 06:04:20,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:20,732 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:20,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-10 06:04:20,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-01-10 06:04:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 150 states have (on average 1.1) internal successors, (165), 154 states have internal predecessors, (165), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2025-01-10 06:04:20,743 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 85 [2025-01-10 06:04:20,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:20,743 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2025-01-10 06:04:20,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:20,743 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2025-01-10 06:04:20,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-10 06:04:20,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:20,747 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 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:04:20,761 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:04:20,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 06:04:20,948 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:04:20,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:20,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1608457051, now seen corresponding path program 1 times [2025-01-10 06:04:20,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:20,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481973467] [2025-01-10 06:04:20,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:20,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:21,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 06:04:21,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 06:04:21,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:21,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-01-10 06:04:27,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:27,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481973467] [2025-01-10 06:04:27,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481973467] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:27,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099983150] [2025-01-10 06:04:27,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:27,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:27,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:27,045 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:04:27,048 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:04:27,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 06:04:27,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 06:04:27,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:27,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:27,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 1786 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-01-10 06:04:27,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:27,968 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:04:28,022 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 06:04:28,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 06:04:28,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-10 06:04:28,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-10 06:04:28,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:04:28,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 100 [2025-01-10 06:04:28,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:04:28,144 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-01-10 06:04:28,144 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 72 [2025-01-10 06:04:28,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:04:28,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 114 [2025-01-10 06:04:28,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:04:28,183 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2025-01-10 06:04:28,184 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 78 [2025-01-10 06:04:28,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:04:28,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2025-01-10 06:04:28,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:04:28,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-01-10 06:04:28,298 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-10 06:04:28,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2025-01-10 06:04:28,411 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:04:28,412 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2025-01-10 06:04:28,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-01-10 06:04:28,538 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:04:28,539 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2025-01-10 06:04:28,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-01-10 06:04:28,660 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:04:28,660 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2025-01-10 06:04:28,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-01-10 06:04:28,782 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:04:28,783 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2025-01-10 06:04:28,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-01-10 06:04:28,889 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:04:28,891 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2025-01-10 06:04:28,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-01-10 06:04:28,997 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:04:28,998 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2025-01-10 06:04:29,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-01-10 06:04:29,107 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:04:29,107 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2025-01-10 06:04:29,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-01-10 06:04:29,215 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:04:29,215 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2025-01-10 06:04:29,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-01-10 06:04:29,324 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:04:29,326 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2025-01-10 06:04:29,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-01-10 06:04:29,444 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:04:29,444 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2025-01-10 06:04:29,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-01-10 06:04:29,708 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-01-10 06:04:29,708 INFO L312 TraceCheckSpWp]: Computing backward predicates...