./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-c00e63d-m [2025-02-06 18:01:07,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:01:07,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 18:01:07,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:01:07,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:01:07,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:01:07,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:01:07,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:01:07,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:01:07,550 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:01:07,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:01:07,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:01:07,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:01:07,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:01:07,551 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:01:07,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:01:07,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:01:07,552 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:01:07,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:01:07,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:01:07,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:01:07,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:01:07,552 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:01:07,552 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:01:07,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:01:07,552 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:01:07,552 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:01:07,553 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:01:07,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:01:07,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:01:07,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:01:07,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:01:07,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:01:07,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:01:07,553 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:01:07,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:01:07,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:01:07,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:01:07,554 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:01:07,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:01:07,554 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:01:07,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:01:07,554 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-02-06 18:01:07,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:01:07,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:01:07,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:01:07,868 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:01:07,868 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:01:07,870 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-02-06 18:01:09,165 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45afcfcf0/246293634239404e8f8bc7d68d0f67a5/FLAGa97521ee1 [2025-02-06 18:01:09,577 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:01:09,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/realpath-1.i [2025-02-06 18:01:09,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45afcfcf0/246293634239404e8f8bc7d68d0f67a5/FLAGa97521ee1 [2025-02-06 18:01:09,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45afcfcf0/246293634239404e8f8bc7d68d0f67a5 [2025-02-06 18:01:09,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:01:09,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:01:09,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:01:09,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:01:09,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:01:09,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:01:09" (1/1) ... [2025-02-06 18:01:09,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9801bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:09, skipping insertion in model container [2025-02-06 18:01:09,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:01:09" (1/1) ... [2025-02-06 18:01:09,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:01:10,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:01:10,458 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:01:10,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:01:10,692 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 18:01:10,699 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:01:10,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:10 WrapperNode [2025-02-06 18:01:10,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:01:10,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:01:10,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:01:10,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:01:10,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:10" (1/1) ... [2025-02-06 18:01:10,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:10" (1/1) ... [2025-02-06 18:01:10,816 INFO L138 Inliner]: procedures = 600, calls = 515, calls flagged for inlining = 18, calls inlined = 15, statements flattened = 830 [2025-02-06 18:01:10,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:01:10,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:01:10,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:01:10,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:01:10,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:10" (1/1) ... [2025-02-06 18:01:10,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:10" (1/1) ... [2025-02-06 18:01:10,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:10" (1/1) ... [2025-02-06 18:01:10,856 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 18:01:10,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:10" (1/1) ... [2025-02-06 18:01:10,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:10" (1/1) ... [2025-02-06 18:01:10,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:10" (1/1) ... [2025-02-06 18:01:10,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:10" (1/1) ... [2025-02-06 18:01:10,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:10" (1/1) ... [2025-02-06 18:01:10,912 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:10" (1/1) ... [2025-02-06 18:01:10,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:01:10,935 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:01:10,935 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:01:10,935 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:01:10,936 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:10" (1/1) ... [2025-02-06 18:01:10,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:01:10,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:10,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:01:10,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:01:10,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:01:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 18:01:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-06 18:01:10,996 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-06 18:01:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 18:01:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 18:01:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:01:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:01:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 18:01:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:01:10,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:01:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 18:01:10,996 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 18:01:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 18:01:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 18:01:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 18:01:10,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 18:01:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:01:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 18:01:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 18:01:10,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 18:01:11,340 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:01:11,342 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:01:12,702 INFO L? ?]: Removed 220 outVars from TransFormulas that were not future-live. [2025-02-06 18:01:12,703 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:01:12,727 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:01:12,729 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:01:12,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:01:12 BoogieIcfgContainer [2025-02-06 18:01:12,730 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:01:12,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:01:12,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:01:12,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:01:12,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:01:09" (1/3) ... [2025-02-06 18:01:12,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20699385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:01:12, skipping insertion in model container [2025-02-06 18:01:12,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:10" (2/3) ... [2025-02-06 18:01:12,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20699385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:01:12, skipping insertion in model container [2025-02-06 18:01:12,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:01:12" (3/3) ... [2025-02-06 18:01:12,741 INFO L128 eAbstractionObserver]: Analyzing ICFG realpath-1.i [2025-02-06 18:01:12,756 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:01:12,758 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG realpath-1.i that has 4 procedures, 154 locations, 1 initial locations, 13 loop locations, and 33 error locations. [2025-02-06 18:01:12,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:01:12,821 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;@68c18566, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:01:12,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-02-06 18:01:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 143 states have internal predecessors, (181), 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-02-06 18:01:12,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 18:01:12,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:12,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 18:01:12,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:12,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:12,843 INFO L85 PathProgramCache]: Analyzing trace with hash 7325567, now seen corresponding path program 1 times [2025-02-06 18:01:12,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:12,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429421355] [2025-02-06 18:01:12,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:12,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:13,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:01:13,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:01:13,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:13,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:13,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:13,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429421355] [2025-02-06 18:01:13,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429421355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:13,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:13,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:13,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919740864] [2025-02-06 18:01:13,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:13,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:13,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:13,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:13,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:13,777 INFO L87 Difference]: Start difference. First operand has 154 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 143 states have internal predecessors, (181), 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-02-06 18:01:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:13,837 INFO L93 Difference]: Finished difference Result 221 states and 282 transitions. [2025-02-06 18:01:13,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:13,839 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-02-06 18:01:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:13,844 INFO L225 Difference]: With dead ends: 221 [2025-02-06 18:01:13,845 INFO L226 Difference]: Without dead ends: 69 [2025-02-06 18:01:13,850 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-02-06 18:01:13,855 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 149 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-02-06 18:01:13,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 149 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:01:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-06 18:01:13,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-06 18:01:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.48) internal successors, (74), 63 states have internal predecessors, (74), 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-02-06 18:01:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2025-02-06 18:01:13,906 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 4 [2025-02-06 18:01:13,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:13,908 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2025-02-06 18:01:13,909 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-02-06 18:01:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2025-02-06 18:01:13,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:01:13,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:13,910 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 18:01:13,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:01:13,912 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:13,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:13,912 INFO L85 PathProgramCache]: Analyzing trace with hash -807194677, now seen corresponding path program 1 times [2025-02-06 18:01:13,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:13,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866044635] [2025-02-06 18:01:13,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:13,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:14,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:01:14,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:01:14,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:14,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:14,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:14,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866044635] [2025-02-06 18:01:14,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866044635] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:14,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548790774] [2025-02-06 18:01:14,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:14,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:14,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:14,402 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:14,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:01:14,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:01:14,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:01:14,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:14,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:14,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:01:14,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:14,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:14,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:01:14,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548790774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:14,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:01:14,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 18:01:14,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915585669] [2025-02-06 18:01:14,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:14,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:01:14,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:14,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:01:14,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:14,943 INFO L87 Difference]: Start difference. First operand 69 states and 80 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-02-06 18:01:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:14,985 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2025-02-06 18:01:14,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:01:14,986 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-02-06 18:01:14,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:14,987 INFO L225 Difference]: With dead ends: 69 [2025-02-06 18:01:14,988 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 18:01:14,988 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-02-06 18:01:14,989 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:14,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 211 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:01:14,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 18:01:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-06 18:01:14,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.46) 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-02-06 18:01:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2025-02-06 18:01:15,004 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 7 [2025-02-06 18:01:15,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:15,004 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2025-02-06 18:01:15,005 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-02-06 18:01:15,005 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2025-02-06 18:01:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 18:01:15,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:15,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 18:01:15,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 18:01:15,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:15,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:15,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:15,207 INFO L85 PathProgramCache]: Analyzing trace with hash 746768961, now seen corresponding path program 1 times [2025-02-06 18:01:15,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:15,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732230811] [2025-02-06 18:01:15,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:15,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:15,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:01:15,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:01:15,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:15,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:01:15,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:15,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732230811] [2025-02-06 18:01:15,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732230811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:15,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:15,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:15,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903883061] [2025-02-06 18:01:15,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:15,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:15,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:15,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:15,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:15,534 INFO L87 Difference]: Start difference. First operand 68 states and 79 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-02-06 18:01:15,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:15,550 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2025-02-06 18:01:15,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:15,550 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-02-06 18:01:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:15,551 INFO L225 Difference]: With dead ends: 68 [2025-02-06 18:01:15,551 INFO L226 Difference]: Without dead ends: 67 [2025-02-06 18:01:15,552 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-02-06 18:01:15,552 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 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-02-06 18:01:15,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:01:15,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-06 18:01:15,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2025-02-06 18:01:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 59 states have internal predecessors, (70), 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-02-06 18:01:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2025-02-06 18:01:15,561 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 8 [2025-02-06 18:01:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:15,561 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2025-02-06 18:01:15,561 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-02-06 18:01:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2025-02-06 18:01:15,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 18:01:15,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:15,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:15,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:01:15,566 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:15,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:15,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1221196747, now seen corresponding path program 1 times [2025-02-06 18:01:15,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:15,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532700246] [2025-02-06 18:01:15,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:15,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:15,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:01:15,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:01:15,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:15,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:15,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:15,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:15,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532700246] [2025-02-06 18:01:15,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532700246] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:15,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392654424] [2025-02-06 18:01:15,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:15,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:15,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:15,982 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:15,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:01:16,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:01:16,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:01:16,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:16,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:16,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:01:16,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:01:16,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:01:16,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392654424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:16,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:01:16,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 18:01:16,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7942006] [2025-02-06 18:01:16,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:16,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:16,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:16,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:16,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:16,509 INFO L87 Difference]: Start difference. First operand 65 states and 76 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-02-06 18:01:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:16,549 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-02-06 18:01:16,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:16,550 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-02-06 18:01:16,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:16,551 INFO L225 Difference]: With dead ends: 65 [2025-02-06 18:01:16,551 INFO L226 Difference]: Without dead ends: 63 [2025-02-06 18:01:16,551 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-02-06 18:01:16,552 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 83 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-02-06 18:01:16,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 83 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:01:16,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-06 18:01:16,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-06 18:01:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.4166666666666667) 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-02-06 18:01:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2025-02-06 18:01:16,564 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 12 [2025-02-06 18:01:16,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:16,565 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2025-02-06 18:01:16,565 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-02-06 18:01:16,565 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2025-02-06 18:01:16,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 18:01:16,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:16,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:16,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 18:01:16,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:16,770 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:16,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:16,771 INFO L85 PathProgramCache]: Analyzing trace with hash -797606341, now seen corresponding path program 1 times [2025-02-06 18:01:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:16,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148542265] [2025-02-06 18:01:16,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:16,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:16,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:01:16,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:01:16,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:16,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:17,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:17,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148542265] [2025-02-06 18:01:17,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148542265] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:17,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983495983] [2025-02-06 18:01:17,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:17,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:17,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:17,169 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:17,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 18:01:17,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:01:17,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:01:17,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:17,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:17,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:01:17,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:17,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:01:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:17,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983495983] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:01:17,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:01:17,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 18:01:17,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164260819] [2025-02-06 18:01:17,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:01:17,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:01:17,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:17,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:01:17,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:01:17,696 INFO L87 Difference]: Start difference. First operand 63 states and 74 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-02-06 18:01:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:17,737 INFO L93 Difference]: Finished difference Result 129 states and 153 transitions. [2025-02-06 18:01:17,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:01:17,737 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-02-06 18:01:17,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:17,738 INFO L225 Difference]: With dead ends: 129 [2025-02-06 18:01:17,739 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 18:01:17,739 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-02-06 18:01:17,740 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 4 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:17,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 206 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:01:17,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 18:01:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-06 18:01:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 66 states have internal predecessors, (77), 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-02-06 18:01:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2025-02-06 18:01:17,747 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 13 [2025-02-06 18:01:17,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:17,747 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2025-02-06 18:01:17,747 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-02-06 18:01:17,747 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2025-02-06 18:01:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 18:01:17,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:17,748 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:17,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 18:01:17,948 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-02-06 18:01:17,949 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:17,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:17,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2009106449, now seen corresponding path program 2 times [2025-02-06 18:01:17,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:17,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061525677] [2025-02-06 18:01:17,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:01:17,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:18,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 18:01:18,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-02-06 18:01:18,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:01:18,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:01:18,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:18,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061525677] [2025-02-06 18:01:18,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061525677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:18,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:18,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:01:18,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591077841] [2025-02-06 18:01:18,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:18,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:01:18,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:18,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:01:18,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:18,466 INFO L87 Difference]: Start difference. First operand 72 states and 83 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-02-06 18:01:18,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:18,525 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2025-02-06 18:01:18,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:01:18,526 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-02-06 18:01:18,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:18,527 INFO L225 Difference]: With dead ends: 72 [2025-02-06 18:01:18,527 INFO L226 Difference]: Without dead ends: 70 [2025-02-06 18:01:18,527 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-02-06 18:01:18,528 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 46 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 194 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.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:18,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 194 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:18,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-06 18:01:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-02-06 18:01:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.3157894736842106) 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-02-06 18:01:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2025-02-06 18:01:18,538 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 22 [2025-02-06 18:01:18,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:18,539 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2025-02-06 18:01:18,539 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-02-06 18:01:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2025-02-06 18:01:18,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 18:01:18,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:18,540 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:18,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:01:18,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:18,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:18,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2029799410, now seen corresponding path program 1 times [2025-02-06 18:01:18,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:18,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671821448] [2025-02-06 18:01:18,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:18,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:18,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 18:01:18,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 18:01:18,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:18,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:01:18,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:18,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671821448] [2025-02-06 18:01:18,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671821448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:18,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:18,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:01:18,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85986929] [2025-02-06 18:01:18,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:18,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:18,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:18,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:18,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:18,905 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) 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-02-06 18:01:18,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:18,932 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2025-02-06 18:01:18,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:18,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) 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-02-06 18:01:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:18,936 INFO L225 Difference]: With dead ends: 123 [2025-02-06 18:01:18,936 INFO L226 Difference]: Without dead ends: 73 [2025-02-06 18:01:18,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02-06 18:01:18,937 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 2 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 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-02-06 18:01:18,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:01:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-06 18:01:18,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-02-06 18:01:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 60 states have (on average 1.3) internal successors, (78), 67 states have internal predecessors, (78), 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-02-06 18:01:18,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2025-02-06 18:01:18,945 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 27 [2025-02-06 18:01:18,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:18,946 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2025-02-06 18:01:18,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) 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-02-06 18:01:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2025-02-06 18:01:18,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 18:01:18,947 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:18,947 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-02-06 18:01:18,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:01:18,947 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:18,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:18,948 INFO L85 PathProgramCache]: Analyzing trace with hash 711677507, now seen corresponding path program 1 times [2025-02-06 18:01:18,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:18,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165999593] [2025-02-06 18:01:18,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:18,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:19,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 18:01:19,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 18:01:19,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:19,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:01:19,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:19,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165999593] [2025-02-06 18:01:19,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165999593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:19,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:19,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:19,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060564291] [2025-02-06 18:01:19,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:19,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:19,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:19,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:19,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:19,322 INFO L87 Difference]: Start difference. First operand 73 states and 84 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-02-06 18:01:19,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:19,343 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2025-02-06 18:01:19,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:19,345 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-02-06 18:01:19,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:19,346 INFO L225 Difference]: With dead ends: 78 [2025-02-06 18:01:19,346 INFO L226 Difference]: Without dead ends: 76 [2025-02-06 18:01:19,346 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-02-06 18:01:19,347 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 132 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-02-06 18:01:19,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 132 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:01:19,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-06 18:01:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-06 18:01:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 70 states have internal predecessors, (81), 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-02-06 18:01:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2025-02-06 18:01:19,360 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 29 [2025-02-06 18:01:19,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:19,361 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2025-02-06 18:01:19,361 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-02-06 18:01:19,361 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2025-02-06 18:01:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 18:01:19,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:19,361 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, 1] [2025-02-06 18:01:19,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:01:19,362 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:19,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:19,362 INFO L85 PathProgramCache]: Analyzing trace with hash 914584360, now seen corresponding path program 1 times [2025-02-06 18:01:19,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:19,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250807662] [2025-02-06 18:01:19,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:19,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:19,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:01:19,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:01:19,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:19,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-06 18:01:19,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:19,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250807662] [2025-02-06 18:01:19,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250807662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:19,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:19,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:19,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638979862] [2025-02-06 18:01:19,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:19,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:19,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:19,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:19,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:19,714 INFO L87 Difference]: Start difference. First operand 76 states and 87 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-02-06 18:01:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:19,748 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2025-02-06 18:01:19,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:19,749 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 30 [2025-02-06 18:01:19,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:19,751 INFO L225 Difference]: With dead ends: 89 [2025-02-06 18:01:19,751 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 18:01:19,752 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-02-06 18:01:19,752 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 128 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-02-06 18:01:19,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 128 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:01:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 18:01:19,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2025-02-06 18:01:19,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 79 states have internal predecessors, (94), 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-02-06 18:01:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2025-02-06 18:01:19,766 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 30 [2025-02-06 18:01:19,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:19,766 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2025-02-06 18:01:19,766 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-02-06 18:01:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2025-02-06 18:01:19,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 18:01:19,766 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:19,767 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-02-06 18:01:19,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:01:19,767 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:19,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:19,767 INFO L85 PathProgramCache]: Analyzing trace with hash 914584520, now seen corresponding path program 1 times [2025-02-06 18:01:19,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:19,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218045472] [2025-02-06 18:01:19,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:19,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:19,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:01:19,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:01:19,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:19,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:01:20,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:20,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218045472] [2025-02-06 18:01:20,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218045472] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:20,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902636819] [2025-02-06 18:01:20,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:20,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:20,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:20,145 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:20,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 18:01:20,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:01:20,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:01:20,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:20,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:20,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 1286 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:01:20,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:01:20,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:01:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:01:20,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902636819] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:01:20,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:01:20,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 18:01:20,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948838520] [2025-02-06 18:01:20,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:01:20,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 18:01:20,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:20,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 18:01:20,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:01:20,856 INFO L87 Difference]: Start difference. First operand 85 states and 100 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-02-06 18:01:20,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:20,972 INFO L93 Difference]: Finished difference Result 172 states and 208 transitions. [2025-02-06 18:01:20,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:01:20,973 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-02-06 18:01:20,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:20,974 INFO L225 Difference]: With dead ends: 172 [2025-02-06 18:01:20,974 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 18:01:20,975 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-02-06 18:01:20,975 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:20,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 422 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:20,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 18:01:21,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-02-06 18:01:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 96 states have internal predecessors, (110), 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-02-06 18:01:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2025-02-06 18:01:21,009 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 30 [2025-02-06 18:01:21,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:21,009 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2025-02-06 18:01:21,009 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-02-06 18:01:21,009 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2025-02-06 18:01:21,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 18:01:21,013 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:21,013 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-02-06 18:01:21,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 18:01:21,214 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,SelfDestructingSolverStorable9 [2025-02-06 18:01:21,214 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:21,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:21,215 INFO L85 PathProgramCache]: Analyzing trace with hash -65990572, now seen corresponding path program 1 times [2025-02-06 18:01:21,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:21,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382853494] [2025-02-06 18:01:21,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:21,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:21,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 18:01:21,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 18:01:21,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:21,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 18:01:21,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:21,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382853494] [2025-02-06 18:01:21,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382853494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:21,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:21,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:21,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773008905] [2025-02-06 18:01:21,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:21,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:21,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:21,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:21,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:21,530 INFO L87 Difference]: Start difference. First operand 102 states and 116 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-02-06 18:01:21,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:21,546 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2025-02-06 18:01:21,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:21,547 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-02-06 18:01:21,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:21,548 INFO L225 Difference]: With dead ends: 102 [2025-02-06 18:01:21,548 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 18:01:21,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-02-06 18:01:21,548 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 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-02-06 18:01:21,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:01:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 18:01:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2025-02-06 18:01:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.2093023255813953) internal successors, (104), 91 states have internal predecessors, (104), 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-02-06 18:01:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2025-02-06 18:01:21,562 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 49 [2025-02-06 18:01:21,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:21,564 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2025-02-06 18:01:21,564 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-02-06 18:01:21,564 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2025-02-06 18:01:21,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 18:01:21,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:21,565 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-02-06 18:01:21,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:01:21,566 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:21,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:21,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1133003750, now seen corresponding path program 1 times [2025-02-06 18:01:21,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:21,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793766193] [2025-02-06 18:01:21,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:21,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:21,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 18:01:21,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 18:01:21,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:21,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:01:21,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:21,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793766193] [2025-02-06 18:01:21,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793766193] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:21,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577850995] [2025-02-06 18:01:21,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:21,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:21,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:21,947 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:21,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 18:01:22,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 18:01:22,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 18:01:22,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:22,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:22,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:01:22,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 18:01:22,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:01:22,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577850995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:22,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:01:22,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-02-06 18:01:22,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565545959] [2025-02-06 18:01:22,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:22,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:01:22,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:22,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:01:22,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:01:22,569 INFO L87 Difference]: Start difference. First operand 97 states and 110 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-02-06 18:01:22,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:22,646 INFO L93 Difference]: Finished difference Result 127 states and 148 transitions. [2025-02-06 18:01:22,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:01:22,647 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-02-06 18:01:22,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:22,648 INFO L225 Difference]: With dead ends: 127 [2025-02-06 18:01:22,649 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 18:01:22,649 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-02-06 18:01:22,650 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 30 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 206 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.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:22,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 206 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:22,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 18:01:22,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2025-02-06 18:01:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.206896551724138) internal successors, (105), 92 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-02-06 18:01:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2025-02-06 18:01:22,662 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 50 [2025-02-06 18:01:22,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:22,662 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2025-02-06 18:01:22,662 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-02-06 18:01:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2025-02-06 18:01:22,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 18:01:22,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:22,663 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] [2025-02-06 18:01:22,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 18:01:22,864 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-02-06 18:01:22,865 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:22,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:22,865 INFO L85 PathProgramCache]: Analyzing trace with hash -915520785, now seen corresponding path program 1 times [2025-02-06 18:01:22,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:22,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967628477] [2025-02-06 18:01:22,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:22,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:23,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 18:01:23,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 18:01:23,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:23,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:01:23,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:23,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967628477] [2025-02-06 18:01:23,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967628477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:23,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:23,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:01:23,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060411558] [2025-02-06 18:01:23,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:23,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:01:23,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:23,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:01:23,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:23,407 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-02-06 18:01:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:23,441 INFO L93 Difference]: Finished difference Result 134 states and 154 transitions. [2025-02-06 18:01:23,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:01:23,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 53 [2025-02-06 18:01:23,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:23,443 INFO L225 Difference]: With dead ends: 134 [2025-02-06 18:01:23,443 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 18:01:23,443 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-02-06 18:01:23,444 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 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-02-06 18:01:23,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:01:23,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 18:01:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-06 18:01:23,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.2) internal successors, (108), 95 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-02-06 18:01:23,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2025-02-06 18:01:23,450 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 53 [2025-02-06 18:01:23,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:23,451 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2025-02-06 18:01:23,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-02-06 18:01:23,451 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2025-02-06 18:01:23,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 18:01:23,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:23,452 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-02-06 18:01:23,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 18:01:23,452 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:23,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:23,453 INFO L85 PathProgramCache]: Analyzing trace with hash -785749526, now seen corresponding path program 1 times [2025-02-06 18:01:23,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:23,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512047007] [2025-02-06 18:01:23,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:23,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:23,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:01:23,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:01:23,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:23,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:01:23,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:23,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512047007] [2025-02-06 18:01:23,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512047007] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:23,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984027840] [2025-02-06 18:01:23,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:23,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:23,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:23,786 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:23,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 18:01:24,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:01:24,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:01:24,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:24,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:24,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:01:24,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:24,417 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:01:24,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:01:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:01:24,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984027840] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:01:24,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:01:24,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 18:01:24,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675905493] [2025-02-06 18:01:24,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:01:24,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:01:24,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:24,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:01:24,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:01:24,455 INFO L87 Difference]: Start difference. First operand 101 states and 114 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-02-06 18:01:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:24,495 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2025-02-06 18:01:24,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:01:24,498 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-02-06 18:01:24,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:24,499 INFO L225 Difference]: With dead ends: 176 [2025-02-06 18:01:24,499 INFO L226 Difference]: Without dead ends: 119 [2025-02-06 18:01:24,500 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-02-06 18:01:24,500 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:24,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 255 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:01:24,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-06 18:01:24,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-06 18:01:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.1666666666666667) internal successors, (126), 113 states have internal predecessors, (126), 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-02-06 18:01:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2025-02-06 18:01:24,510 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 55 [2025-02-06 18:01:24,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:24,511 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2025-02-06 18:01:24,511 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-02-06 18:01:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2025-02-06 18:01:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 18:01:24,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:24,512 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, 1] [2025-02-06 18:01:24,526 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-02-06 18:01:24,712 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,SelfDestructingSolverStorable13 [2025-02-06 18:01:24,713 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting bb_verror_msgErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:24,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash 318459058, now seen corresponding path program 1 times [2025-02-06 18:01:24,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:24,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751386254] [2025-02-06 18:01:24,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:24,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:24,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 18:01:24,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 18:01:24,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:24,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:25,096 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:01:25,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:25,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751386254] [2025-02-06 18:01:25,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751386254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:25,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:25,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:01:25,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692030991] [2025-02-06 18:01:25,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:25,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:01:25,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:25,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:01:25,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:25,100 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-02-06 18:01:25,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:25,127 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2025-02-06 18:01:25,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:01:25,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 57 [2025-02-06 18:01:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:25,129 INFO L225 Difference]: With dead ends: 123 [2025-02-06 18:01:25,129 INFO L226 Difference]: Without dead ends: 119 [2025-02-06 18:01:25,129 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-02-06 18:01:25,129 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 19 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 237 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-02-06 18:01:25,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 237 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:01:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-06 18:01:25,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-06 18:01:25,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.1574074074074074) internal successors, (125), 113 states have internal predecessors, (125), 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-02-06 18:01:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2025-02-06 18:01:25,138 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 57 [2025-02-06 18:01:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:25,138 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2025-02-06 18:01:25,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-02-06 18:01:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2025-02-06 18:01:25,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 18:01:25,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:25,140 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, 1] [2025-02-06 18:01:25,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 18:01:25,140 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting bb_verror_msgErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:25,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:25,141 INFO L85 PathProgramCache]: Analyzing trace with hash 318488849, now seen corresponding path program 1 times [2025-02-06 18:01:25,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:25,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985576631] [2025-02-06 18:01:25,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:25,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:25,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 18:01:25,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 18:01:25,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:25,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:01:25,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:25,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985576631] [2025-02-06 18:01:25,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985576631] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:25,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:25,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:01:25,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262447641] [2025-02-06 18:01:25,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:25,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:01:25,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:25,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:01:25,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:01:25,760 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-02-06 18:01:25,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:25,843 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2025-02-06 18:01:25,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:01:25,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 57 [2025-02-06 18:01:25,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:25,845 INFO L225 Difference]: With dead ends: 155 [2025-02-06 18:01:25,845 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 18:01:25,845 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-02-06 18:01:25,846 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 54 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:25,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 208 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:25,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 18:01:25,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-06 18:01:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 107 states have (on average 1.1495327102803738) internal successors, (123), 112 states have internal predecessors, (123), 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-02-06 18:01:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2025-02-06 18:01:25,856 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 57 [2025-02-06 18:01:25,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:25,856 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2025-02-06 18:01:25,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-02-06 18:01:25,856 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2025-02-06 18:01:25,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 18:01:25,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:25,857 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-02-06 18:01:25,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 18:01:25,857 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:25,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:25,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1826971038, now seen corresponding path program 1 times [2025-02-06 18:01:25,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:25,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450758084] [2025-02-06 18:01:25,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:25,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:25,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 18:01:26,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 18:01:26,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:26,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:26,233 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-06 18:01:26,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:26,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450758084] [2025-02-06 18:01:26,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450758084] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:26,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138675500] [2025-02-06 18:01:26,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:26,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:26,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:26,237 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:26,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 18:01:26,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 18:01:26,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 18:01:26,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:26,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:26,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 1506 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:01:26,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:01:26,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:01:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:01:27,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138675500] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:01:27,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:01:27,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 18:01:27,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713244390] [2025-02-06 18:01:27,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:01:27,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 18:01:27,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:27,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 18:01:27,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:01:27,080 INFO L87 Difference]: Start difference. First operand 118 states and 129 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-02-06 18:01:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:27,190 INFO L93 Difference]: Finished difference Result 219 states and 251 transitions. [2025-02-06 18:01:27,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:01:27,191 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-02-06 18:01:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:27,192 INFO L225 Difference]: With dead ends: 219 [2025-02-06 18:01:27,192 INFO L226 Difference]: Without dead ends: 153 [2025-02-06 18:01:27,192 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-02-06 18:01:27,193 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 5 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:27,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 347 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-06 18:01:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-06 18:01:27,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 143 states have (on average 1.1048951048951048) internal successors, (158), 147 states have internal predecessors, (158), 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-02-06 18:01:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2025-02-06 18:01:27,201 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 66 [2025-02-06 18:01:27,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:27,201 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2025-02-06 18:01:27,202 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-02-06 18:01:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2025-02-06 18:01:27,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 18:01:27,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:27,203 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-02-06 18:01:27,216 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-02-06 18:01:27,403 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-02-06 18:01:27,404 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:27,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:27,404 INFO L85 PathProgramCache]: Analyzing trace with hash -65004723, now seen corresponding path program 1 times [2025-02-06 18:01:27,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:27,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757234247] [2025-02-06 18:01:27,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:27,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:27,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 18:01:27,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 18:01:27,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:27,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:01:27,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:27,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757234247] [2025-02-06 18:01:27,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757234247] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:27,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992085221] [2025-02-06 18:01:27,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:27,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:27,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:27,809 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:27,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 18:01:28,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 18:01:28,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 18:01:28,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:28,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:28,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 1645 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:01:28,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:01:28,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:01:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:01:28,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992085221] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:01:28,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:01:28,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 18:01:28,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225579114] [2025-02-06 18:01:28,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:01:28,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:01:28,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:28,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:01:28,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:01:28,574 INFO L87 Difference]: Start difference. First operand 153 states and 164 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-02-06 18:01:28,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:28,612 INFO L93 Difference]: Finished difference Result 163 states and 176 transitions. [2025-02-06 18:01:28,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:01:28,615 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-02-06 18:01:28,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:28,616 INFO L225 Difference]: With dead ends: 163 [2025-02-06 18:01:28,616 INFO L226 Difference]: Without dead ends: 162 [2025-02-06 18:01:28,617 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-02-06 18:01:28,617 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:28,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:01:28,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-06 18:01:28,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-06 18:01:28,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 152 states have (on average 1.0986842105263157) internal successors, (167), 156 states have internal predecessors, (167), 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-02-06 18:01:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2025-02-06 18:01:28,625 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 85 [2025-02-06 18:01:28,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:28,625 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2025-02-06 18:01:28,626 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-02-06 18:01:28,626 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2025-02-06 18:01:28,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 18:01:28,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:28,627 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, 1] [2025-02-06 18:01:28,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 18:01:28,827 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-02-06 18:01:28,828 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting bb_verror_msgErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 30 more)] === [2025-02-06 18:01:28,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:28,828 INFO L85 PathProgramCache]: Analyzing trace with hash 366738713, now seen corresponding path program 1 times [2025-02-06 18:01:28,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:28,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840047796] [2025-02-06 18:01:28,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:28,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:28,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 18:01:29,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 18:01:29,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:29,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-02-06 18:01:36,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:36,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840047796] [2025-02-06 18:01:36,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840047796] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:36,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840054013] [2025-02-06 18:01:36,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:36,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:36,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:36,078 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:36,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 18:01:36,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 18:01:36,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 18:01:36,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:36,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:36,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 1787 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-02-06 18:01:36,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:36,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 18:01:37,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 18:01:37,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 18:01:37,063 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 18:01:37,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 18:01:37,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:01:37,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:01:37,136 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 76 treesize of output 69 [2025-02-06 18:01:37,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:01:37,149 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 52 treesize of output 45 [2025-02-06 18:01:37,169 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:01:37,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2025-02-06 18:01:37,186 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 18:01:37,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-06 18:01:37,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-06 18:01:37,278 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:01:37,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-06 18:01:37,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-06 18:01:37,359 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:01:37,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-06 18:01:37,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-06 18:01:37,437 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:01:37,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-06 18:01:37,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-06 18:01:37,519 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:01:37,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-06 18:01:37,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-06 18:01:37,607 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:01:37,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-06 18:01:37,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-06 18:01:37,687 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:01:37,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-06 18:01:37,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-06 18:01:37,760 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:01:37,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-06 18:01:37,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-06 18:01:37,847 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:01:37,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-06 18:01:37,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-06 18:01:37,910 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:01:37,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-06 18:01:37,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-06 18:01:37,988 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:01:37,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-02-06 18:01:37,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-06 18:01:38,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2025-02-06 18:01:38,150 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-02-06 18:01:38,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:01:38,521 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_5373 (Array Int Int)) (v_ArrVal_5369 (Array Int Int)) (v_ArrVal_5370 (Array Int Int)) (v_ArrVal_5372 (Array Int Int)) (v_ArrVal_5371 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5369))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5370) .cse1 v_ArrVal_5372) (select (select (store .cse2 .cse1 v_ArrVal_5371) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_5373))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_5374 (Array Int Int)) (v_ArrVal_5369 (Array Int Int)) (v_ArrVal_5371 (Array Int Int))) (= (select (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5369))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_5371)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_5374)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 0))))) (= c_~logmode~0 0) (< (+ |c_ULTIMATE.start_main_~i~3#1| 1) |c_ULTIMATE.start_main_~argc~0#1|)) is different from false [2025-02-06 18:02:25,517 WARN L851 $PredicateComparison]: unable to prove that (or (= c_~logmode~0 0) (let ((.cse10 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10)) (.cse18 (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_5370 (Array Int Int)) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5372 (Array Int Int)) (v_ArrVal_5360 (Array Int Int)) (v_ArrVal_5371 (Array Int Int)) (v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (v_ArrVal_5373 (Array Int Int)) (v_ArrVal_5365 (Array Int Int)) (v_ArrVal_5364 (Array Int Int)) (v_ArrVal_5356 (Array Int Int)) (v_ArrVal_5367 (Array Int Int)) (v_ArrVal_5355 (Array Int Int)) (v_ArrVal_5366 (Array Int Int)) (v_ArrVal_5358 (Array Int Int)) (v_ArrVal_5369 (Array Int Int)) (v_ArrVal_5357 (Array Int Int)) (v_ArrVal_5368 (Array Int Int)) (v_ArrVal_5359 (Array Int Int))) (= (select (select (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5356))) (let ((.cse1 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse16 (store .cse17 .cse1 v_ArrVal_5358))) (let ((.cse2 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse15 (store .cse16 .cse2 v_ArrVal_5360))) (let ((.cse3 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse14 (store .cse15 .cse3 v_ArrVal_5362))) (let ((.cse4 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse13 (store .cse14 .cse4 v_ArrVal_5363))) (let ((.cse5 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse12 (store .cse13 .cse5 v_ArrVal_5365))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse11 (store .cse12 .cse6 v_ArrVal_5368))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse9 (store .cse11 .cse7 v_ArrVal_5369))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5355) .cse1 v_ArrVal_5357) .cse2 v_ArrVal_5359) .cse3 v_ArrVal_5361) .cse4 v_ArrVal_5364) .cse5 v_ArrVal_5366) .cse6 v_ArrVal_5367) .cse7 v_ArrVal_5370) .cse8 v_ArrVal_5372) (select (select (store .cse9 .cse8 v_ArrVal_5371) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5373))))))))))))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse18) 0)) (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5374 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (v_ArrVal_5365 (Array Int Int)) (v_ArrVal_5356 (Array Int Int)) (v_ArrVal_5358 (Array Int Int)) (v_ArrVal_5369 (Array Int Int)) (v_ArrVal_5368 (Array Int Int)) (v_ArrVal_5360 (Array Int Int)) (v_ArrVal_5371 (Array Int Int))) (= (select (select (let ((.cse19 (let ((.cse20 (let ((.cse21 (let ((.cse22 (let ((.cse23 (let ((.cse24 (let ((.cse25 (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5356))) (store .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5358)))) (store .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5360)))) (store .cse25 (select (select .cse25 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5362)))) (store .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5363)))) (store .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5365)))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5368)))) (store .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5369)))) (store .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5371)))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5374)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse18) 0))))) (< (+ |c_ULTIMATE.start_main_~i~3#1| 1) |c_ULTIMATE.start_main_~argc~0#1|)) is different from false [2025-02-06 18:02:29,358 INFO L349 Elim1Store]: treesize reduction 68, result has 58.8 percent of original size [2025-02-06 18:02:29,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 180287 treesize of output 41202 [2025-02-06 18:02:30,513 INFO L349 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2025-02-06 18:02:30,513 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 49283 treesize of output 49264