./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Fibonacci01-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci01-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:30:09,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:30:09,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:30:09,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:30:09,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:30:09,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:30:09,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:30:09,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:30:09,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:30:09,533 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:30:09,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:30:09,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:30:09,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:30:09,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:30:09,534 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:30:09,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:30:09,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:30:09,534 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:30:09,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:30:09,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:30:09,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:30:09,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:30:09,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:30:09,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:30:09,535 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:30:09,535 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:30:09,536 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:30:09,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:30:09,536 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:30:09,536 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:30:09,536 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:30:09,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:30:09,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:30:09,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:30:09,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:30:09,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:30:09,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:30:09,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:30:09,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:30:09,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:30:09,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:30:09,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:30:09,537 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:30:09,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:30:09,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:30:09,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:30:09,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:30:09,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:30:09,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:30:09,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:30:09,538 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 [2025-01-10 02:30:09,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:30:09,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:30:09,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:30:09,807 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:30:09,807 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:30:09,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci01-1.c [2025-01-10 02:30:11,080 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c73db62cc/e5825f44e86f49c7b18f8b1059c004a4/FLAGad95415b2 [2025-01-10 02:30:11,305 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:30:11,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci01-1.c [2025-01-10 02:30:11,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c73db62cc/e5825f44e86f49c7b18f8b1059c004a4/FLAGad95415b2 [2025-01-10 02:30:11,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c73db62cc/e5825f44e86f49c7b18f8b1059c004a4 [2025-01-10 02:30:11,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:30:11,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:30:11,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:30:11,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:30:11,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:30:11,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:30:11" (1/1) ... [2025-01-10 02:30:11,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfce515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:11, skipping insertion in model container [2025-01-10 02:30:11,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:30:11" (1/1) ... [2025-01-10 02:30:11,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:30:11,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:30:11,806 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:30:11,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:30:11,837 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:30:11,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:11 WrapperNode [2025-01-10 02:30:11,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:30:11,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:30:11,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:30:11,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:30:11,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:11" (1/1) ... [2025-01-10 02:30:11,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:11" (1/1) ... [2025-01-10 02:30:11,867 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 29 [2025-01-10 02:30:11,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:30:11,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:30:11,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:30:11,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:30:11,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:11" (1/1) ... [2025-01-10 02:30:11,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:11" (1/1) ... [2025-01-10 02:30:11,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:11" (1/1) ... [2025-01-10 02:30:11,892 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 02:30:11,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:11" (1/1) ... [2025-01-10 02:30:11,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:11" (1/1) ... [2025-01-10 02:30:11,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:11" (1/1) ... [2025-01-10 02:30:11,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:11" (1/1) ... [2025-01-10 02:30:11,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:11" (1/1) ... [2025-01-10 02:30:11,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:11" (1/1) ... [2025-01-10 02:30:11,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:11" (1/1) ... [2025-01-10 02:30:11,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:30:11,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:30:11,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:30:11,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:30:11,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:11" (1/1) ... [2025-01-10 02:30:11,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:30:11,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:11,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 02:30:11,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 02:30:11,964 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-01-10 02:30:11,964 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-01-10 02:30:11,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:30:11,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:30:11,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:30:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:30:12,019 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:30:12,021 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:30:12,145 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-10 02:30:12,145 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:30:12,154 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:30:12,155 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 02:30:12,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:30:12 BoogieIcfgContainer [2025-01-10 02:30:12,155 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:30:12,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:30:12,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:30:12,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:30:12,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:30:11" (1/3) ... [2025-01-10 02:30:12,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59eacb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:30:12, skipping insertion in model container [2025-01-10 02:30:12,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:11" (2/3) ... [2025-01-10 02:30:12,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59eacb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:30:12, skipping insertion in model container [2025-01-10 02:30:12,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:30:12" (3/3) ... [2025-01-10 02:30:12,163 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2025-01-10 02:30:12,173 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:30:12,174 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci01-1.c that has 2 procedures, 36 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-01-10 02:30:12,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:30:12,238 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;@4f43cc9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:30:12,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 02:30:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:30:12,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 02:30:12,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:12,249 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:12,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:12,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:12,255 INFO L85 PathProgramCache]: Analyzing trace with hash 632723839, now seen corresponding path program 1 times [2025-01-10 02:30:12,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:12,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137583319] [2025-01-10 02:30:12,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:12,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:12,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:30:12,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:30:12,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:12,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:12,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:12,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:12,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137583319] [2025-01-10 02:30:12,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137583319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:30:12,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:30:12,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:30:12,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081468920] [2025-01-10 02:30:12,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:30:12,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:30:12,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:12,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:30:12,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:30:12,421 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:12,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:12,460 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2025-01-10 02:30:12,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:30:12,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 02:30:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:12,469 INFO L225 Difference]: With dead ends: 41 [2025-01-10 02:30:12,469 INFO L226 Difference]: Without dead ends: 30 [2025-01-10 02:30:12,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:30:12,474 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:12,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 52 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:30:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-10 02:30:12,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-01-10 02:30:12,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:30:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-01-10 02:30:12,506 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 8 [2025-01-10 02:30:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:12,507 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-01-10 02:30:12,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2025-01-10 02:30:12,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 02:30:12,508 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:12,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:12,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:30:12,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:12,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:12,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1860397429, now seen corresponding path program 1 times [2025-01-10 02:30:12,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:12,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980537564] [2025-01-10 02:30:12,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:12,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:12,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 02:30:12,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 02:30:12,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:12,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:12,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:12,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980537564] [2025-01-10 02:30:12,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980537564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:30:12,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:30:12,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:30:12,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460498727] [2025-01-10 02:30:12,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:30:12,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:30:12,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:12,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:30:12,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:30:12,603 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:12,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:12,695 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-01-10 02:30:12,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:30:12,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 02:30:12,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:12,697 INFO L225 Difference]: With dead ends: 30 [2025-01-10 02:30:12,697 INFO L226 Difference]: Without dead ends: 26 [2025-01-10 02:30:12,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:30:12,698 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:12,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 35 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:30:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-10 02:30:12,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-01-10 02:30:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:30:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-01-10 02:30:12,707 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 9 [2025-01-10 02:30:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:12,707 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-01-10 02:30:12,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:12,708 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-01-10 02:30:12,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 02:30:12,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:12,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:12,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:30:12,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:12,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:12,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1838116578, now seen corresponding path program 1 times [2025-01-10 02:30:12,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:12,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407924923] [2025-01-10 02:30:12,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:12,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:12,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 02:30:12,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 02:30:12,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:12,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:12,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:12,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407924923] [2025-01-10 02:30:12,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407924923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:30:12,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:30:12,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:30:12,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309687970] [2025-01-10 02:30:12,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:30:12,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:30:12,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:12,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:30:12,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:30:12,774 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:30:12,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:12,788 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2025-01-10 02:30:12,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:30:12,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2025-01-10 02:30:12,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:12,790 INFO L225 Difference]: With dead ends: 24 [2025-01-10 02:30:12,790 INFO L226 Difference]: Without dead ends: 21 [2025-01-10 02:30:12,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:30:12,791 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:12,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:30:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-10 02:30:12,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-01-10 02:30:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:30:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-01-10 02:30:12,796 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 10 [2025-01-10 02:30:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:12,796 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-01-10 02:30:12,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:30:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-01-10 02:30:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 02:30:12,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:12,798 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:12,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:30:12,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:12,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:12,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1084830083, now seen corresponding path program 1 times [2025-01-10 02:30:12,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:12,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399778581] [2025-01-10 02:30:12,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:12,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:12,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:30:12,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:30:12,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:12,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:12,961 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 02:30:12,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:12,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399778581] [2025-01-10 02:30:12,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399778581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:30:12,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:30:12,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:30:12,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780395341] [2025-01-10 02:30:12,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:30:12,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:30:12,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:12,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:30:12,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:30:12,964 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:30:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:13,008 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-01-10 02:30:13,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:30:13,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2025-01-10 02:30:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:13,013 INFO L225 Difference]: With dead ends: 35 [2025-01-10 02:30:13,013 INFO L226 Difference]: Without dead ends: 33 [2025-01-10 02:30:13,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:30:13,014 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:13,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:30:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-10 02:30:13,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2025-01-10 02:30:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 02:30:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-01-10 02:30:13,024 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 30 [2025-01-10 02:30:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:13,025 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-01-10 02:30:13,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:30:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-01-10 02:30:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 02:30:13,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:13,028 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:13,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:30:13,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:13,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:13,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1634885931, now seen corresponding path program 1 times [2025-01-10 02:30:13,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:13,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265379989] [2025-01-10 02:30:13,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:13,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:13,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:30:13,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:30:13,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:13,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:30:13,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:13,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265379989] [2025-01-10 02:30:13,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265379989] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:13,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123047039] [2025-01-10 02:30:13,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:13,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:13,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:13,182 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:30:13,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 02:30:13,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:30:13,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:30:13,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:13,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:13,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:30:13,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 02:30:13,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 02:30:13,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123047039] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:13,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:13,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-01-10 02:30:13,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420771133] [2025-01-10 02:30:13,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:13,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 02:30:13,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:13,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 02:30:13,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:30:13,500 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-10 02:30:13,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:13,761 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2025-01-10 02:30:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 02:30:13,762 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2025-01-10 02:30:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:13,763 INFO L225 Difference]: With dead ends: 91 [2025-01-10 02:30:13,764 INFO L226 Difference]: Without dead ends: 65 [2025-01-10 02:30:13,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-01-10 02:30:13,765 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 103 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:13,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 106 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:30:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-10 02:30:13,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2025-01-10 02:30:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) [2025-01-10 02:30:13,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2025-01-10 02:30:13,776 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 25 [2025-01-10 02:30:13,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:13,776 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2025-01-10 02:30:13,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-10 02:30:13,777 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2025-01-10 02:30:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 02:30:13,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:13,778 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:13,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 02:30:13,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:13,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:13,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:13,983 INFO L85 PathProgramCache]: Analyzing trace with hash 123521023, now seen corresponding path program 2 times [2025-01-10 02:30:13,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:13,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742735215] [2025-01-10 02:30:13,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:13,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:13,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 02:30:13,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:30:13,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:13,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:30:14,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:14,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742735215] [2025-01-10 02:30:14,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742735215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:14,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290162256] [2025-01-10 02:30:14,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:14,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:14,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:14,067 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:30:14,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 02:30:14,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 02:30:14,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:30:14,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:14,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:14,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:30:14,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:30:14,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:30:14,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290162256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:30:14,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:30:14,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-01-10 02:30:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607529629] [2025-01-10 02:30:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:30:14,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:30:14,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:14,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:30:14,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:30:14,162 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:30:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:14,193 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2025-01-10 02:30:14,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:30:14,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-01-10 02:30:14,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:14,195 INFO L225 Difference]: With dead ends: 60 [2025-01-10 02:30:14,195 INFO L226 Difference]: Without dead ends: 59 [2025-01-10 02:30:14,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:30:14,196 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:14,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:30:14,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-10 02:30:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2025-01-10 02:30:14,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) [2025-01-10 02:30:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2025-01-10 02:30:14,218 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 25 [2025-01-10 02:30:14,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:14,218 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2025-01-10 02:30:14,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:30:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2025-01-10 02:30:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 02:30:14,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:14,219 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:14,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 02:30:14,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:14,420 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:14,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:14,421 INFO L85 PathProgramCache]: Analyzing trace with hash -465815529, now seen corresponding path program 1 times [2025-01-10 02:30:14,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:14,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679046375] [2025-01-10 02:30:14,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:14,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:14,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:30:14,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:30:14,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:14,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:30:14,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:14,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679046375] [2025-01-10 02:30:14,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679046375] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:14,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209059026] [2025-01-10 02:30:14,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:14,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:14,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:14,526 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:30:14,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 02:30:14,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:30:14,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:30:14,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:14,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:14,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:30:14,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:30:14,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:30:14,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209059026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:30:14,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:30:14,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-01-10 02:30:14,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041730268] [2025-01-10 02:30:14,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:30:14,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:30:14,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:14,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:30:14,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:30:14,620 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:30:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:14,666 INFO L93 Difference]: Finished difference Result 82 states and 117 transitions. [2025-01-10 02:30:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:30:14,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-01-10 02:30:14,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:14,672 INFO L225 Difference]: With dead ends: 82 [2025-01-10 02:30:14,672 INFO L226 Difference]: Without dead ends: 81 [2025-01-10 02:30:14,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:30:14,673 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:14,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 85 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:30:14,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-10 02:30:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2025-01-10 02:30:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 11 states have call predecessors, (27), 7 states have call successors, (27) [2025-01-10 02:30:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2025-01-10 02:30:14,701 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 26 [2025-01-10 02:30:14,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:14,702 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2025-01-10 02:30:14,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:30:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2025-01-10 02:30:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-10 02:30:14,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:14,708 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:14,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 02:30:14,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:14,909 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:14,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:14,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1254155740, now seen corresponding path program 1 times [2025-01-10 02:30:14,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:14,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965120532] [2025-01-10 02:30:14,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:14,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:14,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 02:30:14,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 02:30:14,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:14,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-10 02:30:15,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:15,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965120532] [2025-01-10 02:30:15,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965120532] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:15,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043393862] [2025-01-10 02:30:15,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:15,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:15,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:15,053 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:30:15,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 02:30:15,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 02:30:15,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 02:30:15,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:15,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:15,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:30:15,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-10 02:30:15,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-10 02:30:15,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043393862] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:15,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:15,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-01-10 02:30:15,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601931049] [2025-01-10 02:30:15,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:15,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 02:30:15,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:15,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 02:30:15,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:30:15,383 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-10 02:30:15,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:15,597 INFO L93 Difference]: Finished difference Result 141 states and 217 transitions. [2025-01-10 02:30:15,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 02:30:15,597 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) Word has length 46 [2025-01-10 02:30:15,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:15,601 INFO L225 Difference]: With dead ends: 141 [2025-01-10 02:30:15,603 INFO L226 Difference]: Without dead ends: 139 [2025-01-10 02:30:15,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:30:15,605 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:15,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 173 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:30:15,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-10 02:30:15,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 98. [2025-01-10 02:30:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 75 states have internal predecessors, (82), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2025-01-10 02:30:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 159 transitions. [2025-01-10 02:30:15,629 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 159 transitions. Word has length 46 [2025-01-10 02:30:15,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:15,629 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 159 transitions. [2025-01-10 02:30:15,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-10 02:30:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 159 transitions. [2025-01-10 02:30:15,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-10 02:30:15,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:15,634 INFO L218 NwaCegarLoop]: trace histogram [10, 8, 8, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 02:30:15,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:30:15,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 02:30:15,838 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:15,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:15,838 INFO L85 PathProgramCache]: Analyzing trace with hash 87579128, now seen corresponding path program 1 times [2025-01-10 02:30:15,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:15,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732525463] [2025-01-10 02:30:15,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:15,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:15,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 02:30:15,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 02:30:15,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:15,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 50 proven. 86 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-01-10 02:30:16,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:16,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732525463] [2025-01-10 02:30:16,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732525463] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:16,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239695523] [2025-01-10 02:30:16,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:16,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:16,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:16,027 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:30:16,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 02:30:16,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 02:30:16,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 02:30:16,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:16,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:16,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 02:30:16,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:16,182 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 67 proven. 92 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-10 02:30:16,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:16,552 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 67 proven. 95 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-10 02:30:16,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239695523] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:16,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:16,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 16 [2025-01-10 02:30:16,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121003675] [2025-01-10 02:30:16,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:16,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 02:30:16,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:16,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 02:30:16,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:30:16,555 INFO L87 Difference]: Start difference. First operand 98 states and 159 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 10 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2025-01-10 02:30:16,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:16,716 INFO L93 Difference]: Finished difference Result 174 states and 299 transitions. [2025-01-10 02:30:16,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:30:16,716 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 10 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) Word has length 90 [2025-01-10 02:30:16,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:16,718 INFO L225 Difference]: With dead ends: 174 [2025-01-10 02:30:16,718 INFO L226 Difference]: Without dead ends: 80 [2025-01-10 02:30:16,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 172 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-01-10 02:30:16,720 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 71 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:16,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 76 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:30:16,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-10 02:30:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2025-01-10 02:30:16,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 53 states have internal predecessors, (61), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (26), 12 states have call predecessors, (26), 6 states have call successors, (26) [2025-01-10 02:30:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2025-01-10 02:30:16,735 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 90 [2025-01-10 02:30:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:16,736 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2025-01-10 02:30:16,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 10 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2025-01-10 02:30:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2025-01-10 02:30:16,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-10 02:30:16,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:16,738 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 1, 1, 1, 1, 1] [2025-01-10 02:30:16,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 02:30:16,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:16,939 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:16,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:16,940 INFO L85 PathProgramCache]: Analyzing trace with hash 969727400, now seen corresponding path program 2 times [2025-01-10 02:30:16,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:16,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472412693] [2025-01-10 02:30:16,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:16,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:16,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-01-10 02:30:16,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-01-10 02:30:16,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:16,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 49 proven. 135 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-01-10 02:30:17,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:17,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472412693] [2025-01-10 02:30:17,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472412693] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:17,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207833350] [2025-01-10 02:30:17,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:17,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:17,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:17,145 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:30:17,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 02:30:17,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-01-10 02:30:17,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-01-10 02:30:17,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:17,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:17,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:30:17,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 268 proven. 15 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2025-01-10 02:30:17,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 50 proven. 168 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-01-10 02:30:17,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207833350] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:17,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:17,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2025-01-10 02:30:17,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172566788] [2025-01-10 02:30:17,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:17,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 02:30:17,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:17,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 02:30:17,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:30:17,586 INFO L87 Difference]: Start difference. First operand 70 states and 94 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-01-10 02:30:17,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:17,677 INFO L93 Difference]: Finished difference Result 129 states and 179 transitions. [2025-01-10 02:30:17,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:30:17,678 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) Word has length 123 [2025-01-10 02:30:17,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:17,679 INFO L225 Difference]: With dead ends: 129 [2025-01-10 02:30:17,679 INFO L226 Difference]: Without dead ends: 63 [2025-01-10 02:30:17,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 238 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-01-10 02:30:17,680 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:17,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 68 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:30:17,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-10 02:30:17,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-01-10 02:30:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 46 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (14), 10 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-10 02:30:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2025-01-10 02:30:17,686 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 123 [2025-01-10 02:30:17,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:17,686 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2025-01-10 02:30:17,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-01-10 02:30:17,686 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2025-01-10 02:30:17,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-10 02:30:17,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:17,688 INFO L218 NwaCegarLoop]: trace histogram [17, 15, 14, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 3, 1, 1, 1, 1, 1] [2025-01-10 02:30:17,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 02:30:17,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 02:30:17,892 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:17,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:17,893 INFO L85 PathProgramCache]: Analyzing trace with hash 935400770, now seen corresponding path program 3 times [2025-01-10 02:30:17,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:17,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242629916] [2025-01-10 02:30:17,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:30:17,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:17,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 158 statements into 14 equivalence classes. [2025-01-10 02:30:17,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 71 of 158 statements. [2025-01-10 02:30:17,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-10 02:30:17,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 199 proven. 25 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2025-01-10 02:30:18,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:18,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242629916] [2025-01-10 02:30:18,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242629916] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:18,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589144930] [2025-01-10 02:30:18,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:30:18,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:18,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:18,172 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:30:18,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 02:30:18,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 158 statements into 14 equivalence classes. [2025-01-10 02:30:18,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 71 of 158 statements. [2025-01-10 02:30:18,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-10 02:30:18,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:18,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 02:30:18,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 210 proven. 6 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-01-10 02:30:18,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:18,842 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 210 proven. 6 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-01-10 02:30:18,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589144930] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:18,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:18,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2025-01-10 02:30:18,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521017446] [2025-01-10 02:30:18,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:18,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 02:30:18,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:18,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 02:30:18,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-01-10 02:30:18,845 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (13), 12 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-10 02:30:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:18,942 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2025-01-10 02:30:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 02:30:18,942 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (13), 12 states have call predecessors, (13), 5 states have call successors, (13) Word has length 158 [2025-01-10 02:30:18,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:18,943 INFO L225 Difference]: With dead ends: 64 [2025-01-10 02:30:18,944 INFO L226 Difference]: Without dead ends: 63 [2025-01-10 02:30:18,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 301 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:30:18,945 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:18,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 170 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:30:18,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-10 02:30:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2025-01-10 02:30:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (14), 8 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-10 02:30:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-01-10 02:30:18,952 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 158 [2025-01-10 02:30:18,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:18,952 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-01-10 02:30:18,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (13), 12 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-10 02:30:18,953 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-01-10 02:30:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-10 02:30:18,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:18,954 INFO L218 NwaCegarLoop]: trace histogram [12, 10, 10, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1] [2025-01-10 02:30:18,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 02:30:19,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:19,161 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:19,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:19,161 INFO L85 PathProgramCache]: Analyzing trace with hash 270044825, now seen corresponding path program 2 times [2025-01-10 02:30:19,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:19,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459469266] [2025-01-10 02:30:19,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:19,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:19,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-01-10 02:30:19,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 111 of 111 statements. [2025-01-10 02:30:19,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:19,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 94 proven. 159 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-01-10 02:30:19,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:19,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459469266] [2025-01-10 02:30:19,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459469266] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:19,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246740973] [2025-01-10 02:30:19,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:19,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:19,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:19,450 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:30:19,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 02:30:19,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-01-10 02:30:19,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 111 of 111 statements. [2025-01-10 02:30:19,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:19,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:19,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:30:19,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 106 proven. 158 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-10 02:30:19,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 106 proven. 174 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-01-10 02:30:20,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246740973] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:20,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:20,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 20 [2025-01-10 02:30:20,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323598151] [2025-01-10 02:30:20,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:20,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 02:30:20,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:20,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 02:30:20,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-01-10 02:30:20,181 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 20 states, 20 states have (on average 4.65) internal successors, (93), 20 states have internal predecessors, (93), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (16), 7 states have call predecessors, (16), 13 states have call successors, (16) [2025-01-10 02:30:20,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:20,443 INFO L93 Difference]: Finished difference Result 134 states and 169 transitions. [2025-01-10 02:30:20,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 02:30:20,444 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.65) internal successors, (93), 20 states have internal predecessors, (93), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (16), 7 states have call predecessors, (16), 13 states have call successors, (16) Word has length 111 [2025-01-10 02:30:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:20,446 INFO L225 Difference]: With dead ends: 134 [2025-01-10 02:30:20,446 INFO L226 Difference]: Without dead ends: 84 [2025-01-10 02:30:20,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 214 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2025-01-10 02:30:20,448 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 127 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:20,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 104 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:30:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-10 02:30:20,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2025-01-10 02:30:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 57 states have internal predecessors, (64), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (17), 11 states have call predecessors, (17), 7 states have call successors, (17) [2025-01-10 02:30:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2025-01-10 02:30:20,457 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 111 [2025-01-10 02:30:20,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:20,457 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2025-01-10 02:30:20,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.65) internal successors, (93), 20 states have internal predecessors, (93), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (16), 7 states have call predecessors, (16), 13 states have call successors, (16) [2025-01-10 02:30:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2025-01-10 02:30:20,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-10 02:30:20,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:20,458 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:20,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 02:30:20,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:20,659 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:20,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:20,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2041934374, now seen corresponding path program 3 times [2025-01-10 02:30:20,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:20,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790295537] [2025-01-10 02:30:20,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:30:20,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:20,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 7 equivalence classes. [2025-01-10 02:30:20,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 80 of 86 statements. [2025-01-10 02:30:20,671 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 02:30:20,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 89 proven. 48 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-10 02:30:20,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:20,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790295537] [2025-01-10 02:30:20,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790295537] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:20,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453103357] [2025-01-10 02:30:20,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:30:20,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:20,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:20,810 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:30:20,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 02:30:20,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 7 equivalence classes. [2025-01-10 02:30:20,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 80 of 86 statements. [2025-01-10 02:30:20,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 02:30:20,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:20,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 02:30:20,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-10 02:30:21,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 20 proven. 66 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-01-10 02:30:21,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453103357] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:21,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:21,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 32 [2025-01-10 02:30:21,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254291933] [2025-01-10 02:30:21,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:21,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-10 02:30:21,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:21,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-10 02:30:21,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2025-01-10 02:30:21,825 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 12 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (22), 19 states have call predecessors, (22), 12 states have call successors, (22) [2025-01-10 02:30:22,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:22,683 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2025-01-10 02:30:22,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-10 02:30:22,683 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 12 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (22), 19 states have call predecessors, (22), 12 states have call successors, (22) Word has length 86 [2025-01-10 02:30:22,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:22,684 INFO L225 Difference]: With dead ends: 196 [2025-01-10 02:30:22,684 INFO L226 Difference]: Without dead ends: 128 [2025-01-10 02:30:22,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 154 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=767, Invalid=3139, Unknown=0, NotChecked=0, Total=3906 [2025-01-10 02:30:22,687 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 155 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:22,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 161 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:30:22,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-10 02:30:22,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 101. [2025-01-10 02:30:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.0375) internal successors, (83), 78 states have internal predecessors, (83), 11 states have call successors, (11), 6 states have call predecessors, (11), 9 states have return successors, (47), 16 states have call predecessors, (47), 10 states have call successors, (47) [2025-01-10 02:30:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2025-01-10 02:30:22,697 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 86 [2025-01-10 02:30:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:22,697 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2025-01-10 02:30:22,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 12 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (22), 19 states have call predecessors, (22), 12 states have call successors, (22) [2025-01-10 02:30:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2025-01-10 02:30:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-01-10 02:30:22,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:22,715 INFO L218 NwaCegarLoop]: trace histogram [40, 38, 32, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 12, 8, 1, 1, 1, 1, 1] [2025-01-10 02:30:22,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 02:30:22,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:22,916 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:22,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:22,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1437299107, now seen corresponding path program 4 times [2025-01-10 02:30:22,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:22,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065674438] [2025-01-10 02:30:22,917 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 02:30:22,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:22,933 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 385 statements into 2 equivalence classes. [2025-01-10 02:30:22,947 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 228 of 385 statements. [2025-01-10 02:30:22,951 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 02:30:22,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5229 backedges. 455 proven. 1234 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2025-01-10 02:30:23,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:23,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065674438] [2025-01-10 02:30:23,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065674438] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:23,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285773931] [2025-01-10 02:30:23,215 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 02:30:23,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:23,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:23,218 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:30:23,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 02:30:23,285 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 385 statements into 2 equivalence classes. [2025-01-10 02:30:23,331 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 228 of 385 statements. [2025-01-10 02:30:23,331 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 02:30:23,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:23,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 02:30:23,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5229 backedges. 426 proven. 1723 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2025-01-10 02:30:23,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5229 backedges. 426 proven. 1762 refuted. 0 times theorem prover too weak. 3041 trivial. 0 not checked. [2025-01-10 02:30:24,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285773931] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:24,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:24,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 19] total 24 [2025-01-10 02:30:24,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753263940] [2025-01-10 02:30:24,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:24,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 02:30:24,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:24,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 02:30:24,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2025-01-10 02:30:24,705 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 24 states have internal predecessors, (134), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (28), 12 states have call predecessors, (28), 18 states have call successors, (28) [2025-01-10 02:30:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:25,028 INFO L93 Difference]: Finished difference Result 251 states and 397 transitions. [2025-01-10 02:30:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 02:30:25,029 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 24 states have internal predecessors, (134), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (28), 12 states have call predecessors, (28), 18 states have call successors, (28) Word has length 385 [2025-01-10 02:30:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:25,030 INFO L225 Difference]: With dead ends: 251 [2025-01-10 02:30:25,030 INFO L226 Difference]: Without dead ends: 156 [2025-01-10 02:30:25,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 757 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=416, Invalid=1144, Unknown=0, NotChecked=0, Total=1560 [2025-01-10 02:30:25,032 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 164 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:25,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 148 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:30:25,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-10 02:30:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 140. [2025-01-10 02:30:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 112 states have (on average 1.0446428571428572) internal successors, (117), 108 states have internal predecessors, (117), 15 states have call successors, (15), 8 states have call predecessors, (15), 12 states have return successors, (57), 23 states have call predecessors, (57), 14 states have call successors, (57) [2025-01-10 02:30:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 189 transitions. [2025-01-10 02:30:25,053 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 189 transitions. Word has length 385 [2025-01-10 02:30:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:25,053 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 189 transitions. [2025-01-10 02:30:25,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 24 states have internal predecessors, (134), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (28), 12 states have call predecessors, (28), 18 states have call successors, (28) [2025-01-10 02:30:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 189 transitions. [2025-01-10 02:30:25,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-01-10 02:30:25,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:25,059 INFO L218 NwaCegarLoop]: trace histogram [47, 45, 38, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 21, 15, 9, 1, 1, 1, 1, 1] [2025-01-10 02:30:25,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 02:30:25,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 02:30:25,264 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:25,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:25,265 INFO L85 PathProgramCache]: Analyzing trace with hash 646779311, now seen corresponding path program 5 times [2025-01-10 02:30:25,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:25,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965764701] [2025-01-10 02:30:25,266 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 02:30:25,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:25,284 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 453 statements into 35 equivalence classes. [2025-01-10 02:30:25,321 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) and asserted 324 of 453 statements. [2025-01-10 02:30:25,321 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2025-01-10 02:30:25,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7309 backedges. 1748 proven. 1130 refuted. 0 times theorem prover too weak. 4431 trivial. 0 not checked. [2025-01-10 02:30:25,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:25,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965764701] [2025-01-10 02:30:25,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965764701] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:25,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730402451] [2025-01-10 02:30:25,842 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 02:30:25,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:25,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:25,844 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:30:25,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 02:30:25,915 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 453 statements into 35 equivalence classes. [2025-01-10 02:30:25,999 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) and asserted 324 of 453 statements. [2025-01-10 02:30:25,999 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2025-01-10 02:30:25,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:26,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 02:30:26,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:26,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7309 backedges. 1733 proven. 1157 refuted. 0 times theorem prover too weak. 4419 trivial. 0 not checked. [2025-01-10 02:30:26,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7309 backedges. 1730 proven. 1216 refuted. 0 times theorem prover too weak. 4363 trivial. 0 not checked. [2025-01-10 02:30:27,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730402451] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:27,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:27,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 22] total 30 [2025-01-10 02:30:27,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311037004] [2025-01-10 02:30:27,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:27,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-10 02:30:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:27,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 02:30:27,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2025-01-10 02:30:27,747 INFO L87 Difference]: Start difference. First operand 140 states and 189 transitions. Second operand has 30 states, 30 states have (on average 5.133333333333334) internal successors, (154), 30 states have internal predecessors, (154), 21 states have call successors, (26), 1 states have call predecessors, (26), 11 states have return successors, (32), 13 states have call predecessors, (32), 21 states have call successors, (32) [2025-01-10 02:30:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:28,234 INFO L93 Difference]: Finished difference Result 278 states and 438 transitions. [2025-01-10 02:30:28,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-10 02:30:28,235 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.133333333333334) internal successors, (154), 30 states have internal predecessors, (154), 21 states have call successors, (26), 1 states have call predecessors, (26), 11 states have return successors, (32), 13 states have call predecessors, (32), 21 states have call successors, (32) Word has length 453 [2025-01-10 02:30:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:28,237 INFO L225 Difference]: With dead ends: 278 [2025-01-10 02:30:28,237 INFO L226 Difference]: Without dead ends: 144 [2025-01-10 02:30:28,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 892 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=1820, Unknown=0, NotChecked=0, Total=2450 [2025-01-10 02:30:28,240 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 287 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:28,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 166 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:30:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-01-10 02:30:28,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 122. [2025-01-10 02:30:28,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 95 states have internal predecessors, (104), 14 states have call successors, (14), 11 states have call predecessors, (14), 8 states have return successors, (32), 15 states have call predecessors, (32), 13 states have call successors, (32) [2025-01-10 02:30:28,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 150 transitions. [2025-01-10 02:30:28,254 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 150 transitions. Word has length 453 [2025-01-10 02:30:28,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:28,254 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 150 transitions. [2025-01-10 02:30:28,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.133333333333334) internal successors, (154), 30 states have internal predecessors, (154), 21 states have call successors, (26), 1 states have call predecessors, (26), 11 states have return successors, (32), 13 states have call predecessors, (32), 21 states have call successors, (32) [2025-01-10 02:30:28,255 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 150 transitions. [2025-01-10 02:30:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-01-10 02:30:28,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:28,257 INFO L218 NwaCegarLoop]: trace histogram [28, 26, 23, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 9, 5, 1, 1, 1, 1, 1] [2025-01-10 02:30:28,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 02:30:28,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 02:30:28,461 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:28,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:28,461 INFO L85 PathProgramCache]: Analyzing trace with hash 208309565, now seen corresponding path program 6 times [2025-01-10 02:30:28,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:28,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752384674] [2025-01-10 02:30:28,462 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 02:30:28,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:28,474 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 268 statements into 20 equivalence classes. [2025-01-10 02:30:28,500 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) and asserted 191 of 268 statements. [2025-01-10 02:30:28,500 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2025-01-10 02:30:28,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2478 backedges. 524 proven. 695 refuted. 0 times theorem prover too weak. 1259 trivial. 0 not checked. [2025-01-10 02:30:28,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:28,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752384674] [2025-01-10 02:30:28,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752384674] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:28,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517330492] [2025-01-10 02:30:28,739 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 02:30:28,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:28,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:28,741 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:30:28,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 02:30:28,812 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 268 statements into 20 equivalence classes. [2025-01-10 02:30:28,856 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) and asserted 191 of 268 statements. [2025-01-10 02:30:28,856 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2025-01-10 02:30:28,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:28,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 02:30:28,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2478 backedges. 519 proven. 734 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-01-10 02:30:29,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:30,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2478 backedges. 515 proven. 786 refuted. 0 times theorem prover too weak. 1177 trivial. 0 not checked. [2025-01-10 02:30:30,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517330492] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:30,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:30,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 18] total 24 [2025-01-10 02:30:30,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81556175] [2025-01-10 02:30:30,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:30,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 02:30:30,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:30,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 02:30:30,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2025-01-10 02:30:30,287 INFO L87 Difference]: Start difference. First operand 122 states and 150 transitions. Second operand has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 19 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (29), 14 states have call predecessors, (29), 19 states have call successors, (29) [2025-01-10 02:30:30,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:30,605 INFO L93 Difference]: Finished difference Result 240 states and 318 transitions. [2025-01-10 02:30:30,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 02:30:30,606 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 19 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (29), 14 states have call predecessors, (29), 19 states have call successors, (29) Word has length 268 [2025-01-10 02:30:30,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:30,608 INFO L225 Difference]: With dead ends: 240 [2025-01-10 02:30:30,608 INFO L226 Difference]: Without dead ends: 124 [2025-01-10 02:30:30,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 522 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=312, Invalid=810, Unknown=0, NotChecked=0, Total=1122 [2025-01-10 02:30:30,610 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 68 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:30,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 217 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:30:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-10 02:30:30,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 113. [2025-01-10 02:30:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.032967032967033) internal successors, (94), 89 states have internal predecessors, (94), 14 states have call successors, (14), 11 states have call predecessors, (14), 7 states have return successors, (28), 12 states have call predecessors, (28), 13 states have call successors, (28) [2025-01-10 02:30:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 136 transitions. [2025-01-10 02:30:30,621 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 136 transitions. Word has length 268 [2025-01-10 02:30:30,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:30,621 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 136 transitions. [2025-01-10 02:30:30,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 19 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (29), 14 states have call predecessors, (29), 19 states have call successors, (29) [2025-01-10 02:30:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 136 transitions. [2025-01-10 02:30:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2025-01-10 02:30:30,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:30,626 INFO L218 NwaCegarLoop]: trace histogram [78, 75, 63, 39, 39, 39, 39, 38, 38, 38, 38, 38, 37, 37, 37, 36, 24, 15, 1, 1, 1, 1, 1] [2025-01-10 02:30:30,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 02:30:30,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:30,831 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:30,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:30,831 INFO L85 PathProgramCache]: Analyzing trace with hash 98960510, now seen corresponding path program 7 times [2025-01-10 02:30:30,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:30,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036526078] [2025-01-10 02:30:30,832 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 02:30:30,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:30,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 753 statements into 1 equivalence classes. [2025-01-10 02:30:30,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 753 of 753 statements. [2025-01-10 02:30:30,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:30,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 20542 backedges. 1130 proven. 4277 refuted. 0 times theorem prover too weak. 15135 trivial. 0 not checked. [2025-01-10 02:30:31,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:31,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036526078] [2025-01-10 02:30:31,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036526078] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:31,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177022247] [2025-01-10 02:30:31,966 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 02:30:31,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:31,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:31,968 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:30:31,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 02:30:32,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 753 statements into 1 equivalence classes. [2025-01-10 02:30:32,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 753 of 753 statements. [2025-01-10 02:30:32,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:32,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:32,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 1411 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 02:30:32,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:32,488 INFO L134 CoverageAnalysis]: Checked inductivity of 20542 backedges. 10375 proven. 2740 refuted. 0 times theorem prover too weak. 7427 trivial. 0 not checked. [2025-01-10 02:30:32,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 20542 backedges. 1365 proven. 5156 refuted. 0 times theorem prover too weak. 14021 trivial. 0 not checked. [2025-01-10 02:30:34,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177022247] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:34,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:34,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 25] total 30 [2025-01-10 02:30:34,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546683450] [2025-01-10 02:30:34,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:34,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-10 02:30:34,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:34,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 02:30:34,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2025-01-10 02:30:34,326 INFO L87 Difference]: Start difference. First operand 113 states and 136 transitions. Second operand has 30 states, 30 states have (on average 6.0) internal successors, (180), 30 states have internal predecessors, (180), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) [2025-01-10 02:30:34,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:34,787 INFO L93 Difference]: Finished difference Result 265 states and 344 transitions. [2025-01-10 02:30:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-10 02:30:34,788 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.0) internal successors, (180), 30 states have internal predecessors, (180), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) Word has length 753 [2025-01-10 02:30:34,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:34,791 INFO L225 Difference]: With dead ends: 265 [2025-01-10 02:30:34,791 INFO L226 Difference]: Without dead ends: 158 [2025-01-10 02:30:34,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1557 GetRequests, 1488 SyntacticMatches, 15 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=796, Invalid=2284, Unknown=0, NotChecked=0, Total=3080 [2025-01-10 02:30:34,794 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 368 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:34,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 165 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:30:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-01-10 02:30:34,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 125. [2025-01-10 02:30:34,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.03) internal successors, (103), 99 states have internal predecessors, (103), 16 states have call successors, (16), 12 states have call predecessors, (16), 8 states have return successors, (35), 13 states have call predecessors, (35), 15 states have call successors, (35) [2025-01-10 02:30:34,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 154 transitions. [2025-01-10 02:30:34,805 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 154 transitions. Word has length 753 [2025-01-10 02:30:34,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:34,807 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 154 transitions. [2025-01-10 02:30:34,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.0) internal successors, (180), 30 states have internal predecessors, (180), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) [2025-01-10 02:30:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 154 transitions. [2025-01-10 02:30:34,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-01-10 02:30:34,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:34,810 INFO L218 NwaCegarLoop]: trace histogram [41, 40, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 13, 8, 1, 1, 1, 1, 1] [2025-01-10 02:30:34,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 02:30:35,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 02:30:35,014 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:35,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:35,014 INFO L85 PathProgramCache]: Analyzing trace with hash 484436312, now seen corresponding path program 8 times [2025-01-10 02:30:35,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:35,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106983443] [2025-01-10 02:30:35,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:35,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:35,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 399 statements into 2 equivalence classes. [2025-01-10 02:30:35,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 399 of 399 statements. [2025-01-10 02:30:35,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:35,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5628 backedges. 830 proven. 1470 refuted. 0 times theorem prover too weak. 3328 trivial. 0 not checked. [2025-01-10 02:30:37,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:37,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106983443] [2025-01-10 02:30:37,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106983443] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:37,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294955165] [2025-01-10 02:30:37,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:37,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:37,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:37,208 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:30:37,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 02:30:37,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 399 statements into 2 equivalence classes. [2025-01-10 02:30:37,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 399 of 399 statements. [2025-01-10 02:30:37,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:37,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:37,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-01-10 02:30:37,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5628 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 3696 trivial. 0 not checked. [2025-01-10 02:30:37,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5628 backedges. 1149 proven. 1015 refuted. 0 times theorem prover too weak. 3464 trivial. 0 not checked. [2025-01-10 02:30:43,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294955165] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:43,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:43,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 29] total 45 [2025-01-10 02:30:43,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809103603] [2025-01-10 02:30:43,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:43,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-10 02:30:43,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:43,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-10 02:30:43,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1607, Unknown=0, NotChecked=0, Total=2070 [2025-01-10 02:30:43,681 INFO L87 Difference]: Start difference. First operand 125 states and 154 transitions. Second operand has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (31), 31 states have call predecessors, (31), 12 states have call successors, (31) [2025-01-10 02:30:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:43,881 INFO L93 Difference]: Finished difference Result 156 states and 208 transitions. [2025-01-10 02:30:43,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-10 02:30:43,882 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (31), 31 states have call predecessors, (31), 12 states have call successors, (31) Word has length 399 [2025-01-10 02:30:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:43,884 INFO L225 Difference]: With dead ends: 156 [2025-01-10 02:30:43,884 INFO L226 Difference]: Without dead ends: 155 [2025-01-10 02:30:43,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 782 SyntacticMatches, 51 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2454 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=544, Invalid=1906, Unknown=0, NotChecked=0, Total=2450 [2025-01-10 02:30:43,885 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:43,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 291 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:30:43,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-10 02:30:43,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 146. [2025-01-10 02:30:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 117 states have (on average 1.0256410256410255) internal successors, (120), 115 states have internal predecessors, (120), 18 states have call successors, (18), 12 states have call predecessors, (18), 10 states have return successors, (55), 18 states have call predecessors, (55), 17 states have call successors, (55) [2025-01-10 02:30:43,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 193 transitions. [2025-01-10 02:30:43,899 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 193 transitions. Word has length 399 [2025-01-10 02:30:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:43,900 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 193 transitions. [2025-01-10 02:30:43,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (31), 31 states have call predecessors, (31), 12 states have call successors, (31) [2025-01-10 02:30:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 193 transitions. [2025-01-10 02:30:43,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2025-01-10 02:30:43,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:43,906 INFO L218 NwaCegarLoop]: trace histogram [83, 82, 67, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 40, 26, 16, 1, 1, 1, 1, 1] [2025-01-10 02:30:43,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 02:30:44,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:30:44,107 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:44,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:44,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1565752271, now seen corresponding path program 9 times [2025-01-10 02:30:44,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:44,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458550850] [2025-01-10 02:30:44,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:30:44,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:44,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 811 statements into 64 equivalence classes. [2025-01-10 02:30:44,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) and asserted 606 of 811 statements. [2025-01-10 02:30:44,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2025-01-10 02:30:44,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 23859 backedges. 2344 proven. 4189 refuted. 0 times theorem prover too weak. 17326 trivial. 0 not checked. [2025-01-10 02:30:44,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:44,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458550850] [2025-01-10 02:30:44,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458550850] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:44,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2190342] [2025-01-10 02:30:44,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:30:44,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:44,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:44,852 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:30:44,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 02:30:45,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 811 statements into 64 equivalence classes. [2025-01-10 02:30:45,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) and asserted 606 of 811 statements. [2025-01-10 02:30:45,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2025-01-10 02:30:45,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:45,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 02:30:45,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 23859 backedges. 2324 proven. 4206 refuted. 0 times theorem prover too weak. 17329 trivial. 0 not checked. [2025-01-10 02:30:45,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 23859 backedges. 2324 proven. 4323 refuted. 0 times theorem prover too weak. 17212 trivial. 0 not checked. [2025-01-10 02:30:47,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2190342] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:47,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:47,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 25] total 29 [2025-01-10 02:30:47,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982373064] [2025-01-10 02:30:47,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:47,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-10 02:30:47,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:47,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-10 02:30:47,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2025-01-10 02:30:47,804 INFO L87 Difference]: Start difference. First operand 146 states and 193 transitions. Second operand has 29 states, 29 states have (on average 5.413793103448276) internal successors, (157), 29 states have internal predecessors, (157), 19 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (32), 16 states have call predecessors, (32), 19 states have call successors, (32) [2025-01-10 02:30:48,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:48,251 INFO L93 Difference]: Finished difference Result 364 states and 520 transitions. [2025-01-10 02:30:48,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-10 02:30:48,251 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.413793103448276) internal successors, (157), 29 states have internal predecessors, (157), 19 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (32), 16 states have call predecessors, (32), 19 states have call successors, (32) Word has length 811 [2025-01-10 02:30:48,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:48,254 INFO L225 Difference]: With dead ends: 364 [2025-01-10 02:30:48,254 INFO L226 Difference]: Without dead ends: 224 [2025-01-10 02:30:48,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1675 GetRequests, 1610 SyntacticMatches, 12 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=766, Invalid=2204, Unknown=0, NotChecked=0, Total=2970 [2025-01-10 02:30:48,257 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 490 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:48,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 186 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:30:48,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-01-10 02:30:48,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 185. [2025-01-10 02:30:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 150 states have (on average 1.0333333333333334) internal successors, (155), 146 states have internal predecessors, (155), 23 states have call successors, (23), 17 states have call predecessors, (23), 11 states have return successors, (64), 21 states have call predecessors, (64), 22 states have call successors, (64) [2025-01-10 02:30:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 242 transitions. [2025-01-10 02:30:48,275 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 242 transitions. Word has length 811 [2025-01-10 02:30:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:48,275 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 242 transitions. [2025-01-10 02:30:48,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.413793103448276) internal successors, (157), 29 states have internal predecessors, (157), 19 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (32), 16 states have call predecessors, (32), 19 states have call successors, (32) [2025-01-10 02:30:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2025-01-10 02:30:48,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2025-01-10 02:30:48,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:48,281 INFO L218 NwaCegarLoop]: trace histogram [84, 82, 68, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 41, 40, 26, 16, 1, 1, 1, 1, 1] [2025-01-10 02:30:48,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 02:30:48,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:48,482 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:48,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:48,482 INFO L85 PathProgramCache]: Analyzing trace with hash -322537651, now seen corresponding path program 10 times [2025-01-10 02:30:48,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:48,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483924625] [2025-01-10 02:30:48,482 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 02:30:48,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:48,499 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 817 statements into 2 equivalence classes. [2025-01-10 02:30:48,532 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 484 of 817 statements. [2025-01-10 02:30:48,533 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 02:30:48,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 24215 backedges. 2309 proven. 4945 refuted. 0 times theorem prover too weak. 16961 trivial. 0 not checked. [2025-01-10 02:30:49,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:49,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483924625] [2025-01-10 02:30:49,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483924625] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:49,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122921847] [2025-01-10 02:30:49,057 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 02:30:49,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:49,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:49,059 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:30:49,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 02:30:49,244 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 817 statements into 2 equivalence classes. [2025-01-10 02:30:49,323 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 484 of 817 statements. [2025-01-10 02:30:49,323 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 02:30:49,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:49,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 02:30:49,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 24215 backedges. 12370 proven. 2667 refuted. 0 times theorem prover too weak. 9178 trivial. 0 not checked. [2025-01-10 02:30:49,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 24215 backedges. 2300 proven. 5308 refuted. 0 times theorem prover too weak. 16607 trivial. 0 not checked. [2025-01-10 02:30:52,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122921847] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:52,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:52,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 27] total 32 [2025-01-10 02:30:52,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964800889] [2025-01-10 02:30:52,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:52,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-10 02:30:52,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:52,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-10 02:30:52,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2025-01-10 02:30:52,569 INFO L87 Difference]: Start difference. First operand 185 states and 242 transitions. Second operand has 32 states, 32 states have (on average 5.71875) internal successors, (183), 32 states have internal predecessors, (183), 26 states have call successors, (31), 2 states have call predecessors, (31), 14 states have return successors, (40), 14 states have call predecessors, (40), 26 states have call successors, (40) [2025-01-10 02:30:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:52,963 INFO L93 Difference]: Finished difference Result 364 states and 493 transitions. [2025-01-10 02:30:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-10 02:30:52,963 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.71875) internal successors, (183), 32 states have internal predecessors, (183), 26 states have call successors, (31), 2 states have call predecessors, (31), 14 states have return successors, (40), 14 states have call predecessors, (40), 26 states have call successors, (40) Word has length 817 [2025-01-10 02:30:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:52,966 INFO L225 Difference]: With dead ends: 364 [2025-01-10 02:30:52,966 INFO L226 Difference]: Without dead ends: 185 [2025-01-10 02:30:52,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1678 GetRequests, 1617 SyntacticMatches, 13 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=632, Invalid=1818, Unknown=0, NotChecked=0, Total=2450 [2025-01-10 02:30:52,968 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 240 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:52,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 248 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:30:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-10 02:30:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 149. [2025-01-10 02:30:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 120 states have (on average 1.025) internal successors, (123), 118 states have internal predecessors, (123), 19 states have call successors, (19), 14 states have call predecessors, (19), 9 states have return successors, (45), 16 states have call predecessors, (45), 18 states have call successors, (45) [2025-01-10 02:30:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 187 transitions. [2025-01-10 02:30:52,979 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 187 transitions. Word has length 817 [2025-01-10 02:30:52,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:52,980 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 187 transitions. [2025-01-10 02:30:52,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.71875) internal successors, (183), 32 states have internal predecessors, (183), 26 states have call successors, (31), 2 states have call predecessors, (31), 14 states have return successors, (40), 14 states have call predecessors, (40), 26 states have call successors, (40) [2025-01-10 02:30:52,980 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 187 transitions. [2025-01-10 02:30:53,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1584 [2025-01-10 02:30:53,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:53,008 INFO L218 NwaCegarLoop]: trace histogram [163, 159, 132, 82, 82, 82, 82, 80, 80, 80, 80, 80, 79, 79, 79, 78, 50, 31, 1, 1, 1, 1, 1] [2025-01-10 02:30:53,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-10 02:30:53,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:53,209 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:53,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:53,210 INFO L85 PathProgramCache]: Analyzing trace with hash -896848870, now seen corresponding path program 11 times [2025-01-10 02:30:53,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:53,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626049306] [2025-01-10 02:30:53,210 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 02:30:53,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:53,233 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1583 statements into 123 equivalence classes. [2025-01-10 02:30:53,419 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 107 check-sat command(s) and asserted 1356 of 1583 statements. [2025-01-10 02:30:53,420 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 107 check-sat command(s) [2025-01-10 02:30:53,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 92020 backedges. 11690 proven. 5540 refuted. 0 times theorem prover too weak. 74790 trivial. 0 not checked. [2025-01-10 02:30:55,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:55,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626049306] [2025-01-10 02:30:55,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626049306] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:55,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306287346] [2025-01-10 02:30:55,477 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 02:30:55,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:55,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:55,480 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:30:55,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 02:30:55,757 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1583 statements into 123 equivalence classes. [2025-01-10 02:30:56,151 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 107 check-sat command(s) and asserted 1356 of 1583 statements. [2025-01-10 02:30:56,152 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 107 check-sat command(s) [2025-01-10 02:30:56,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:56,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 2504 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 02:30:56,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 92020 backedges. 11684 proven. 5515 refuted. 0 times theorem prover too weak. 74821 trivial. 0 not checked. [2025-01-10 02:30:56,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 92020 backedges. 11684 proven. 5682 refuted. 0 times theorem prover too weak. 74654 trivial. 0 not checked. [2025-01-10 02:31:00,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306287346] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:00,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:00,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 31] total 35 [2025-01-10 02:31:00,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035667371] [2025-01-10 02:31:00,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:00,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-10 02:31:00,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:00,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-10 02:31:00,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=968, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 02:31:00,581 INFO L87 Difference]: Start difference. First operand 149 states and 187 transitions. Second operand has 35 states, 35 states have (on average 5.628571428571429) internal successors, (197), 35 states have internal predecessors, (197), 29 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (43), 18 states have call predecessors, (43), 29 states have call successors, (43) [2025-01-10 02:31:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:01,116 INFO L93 Difference]: Finished difference Result 327 states and 428 transitions. [2025-01-10 02:31:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-10 02:31:01,117 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.628571428571429) internal successors, (197), 35 states have internal predecessors, (197), 29 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (43), 18 states have call predecessors, (43), 29 states have call successors, (43) Word has length 1583 [2025-01-10 02:31:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:01,121 INFO L225 Difference]: With dead ends: 327 [2025-01-10 02:31:01,121 INFO L226 Difference]: Without dead ends: 184 [2025-01-10 02:31:01,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3218 GetRequests, 3149 SyntacticMatches, 15 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=779, Invalid=2301, Unknown=0, NotChecked=0, Total=3080 [2025-01-10 02:31:01,124 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 296 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:01,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 329 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:31:01,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-10 02:31:01,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 155. [2025-01-10 02:31:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 125 states have (on average 1.024) internal successors, (128), 123 states have internal predecessors, (128), 20 states have call successors, (20), 15 states have call predecessors, (20), 9 states have return successors, (47), 16 states have call predecessors, (47), 19 states have call successors, (47) [2025-01-10 02:31:01,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 195 transitions. [2025-01-10 02:31:01,136 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 195 transitions. Word has length 1583 [2025-01-10 02:31:01,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:01,138 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 195 transitions. [2025-01-10 02:31:01,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.628571428571429) internal successors, (197), 35 states have internal predecessors, (197), 29 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (43), 18 states have call predecessors, (43), 29 states have call successors, (43) [2025-01-10 02:31:01,138 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 195 transitions. [2025-01-10 02:31:01,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1073 [2025-01-10 02:31:01,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:01,146 INFO L218 NwaCegarLoop]: trace histogram [110, 108, 89, 55, 55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 53, 34, 21, 1, 1, 1, 1, 1] [2025-01-10 02:31:01,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-10 02:31:01,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:01,346 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:31:01,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:01,347 INFO L85 PathProgramCache]: Analyzing trace with hash -2088040270, now seen corresponding path program 12 times [2025-01-10 02:31:01,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:01,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328060256] [2025-01-10 02:31:01,347 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 02:31:01,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:01,364 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1072 statements into 76 equivalence classes. [2025-01-10 02:31:01,503 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 76 check-sat command(s) and asserted 1072 of 1072 statements. [2025-01-10 02:31:01,503 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 76 check-sat command(s) [2025-01-10 02:31:01,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 41934 backedges. 7360 proven. 10131 refuted. 0 times theorem prover too weak. 24443 trivial. 0 not checked. [2025-01-10 02:31:15,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:15,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328060256] [2025-01-10 02:31:15,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328060256] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:15,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528289008] [2025-01-10 02:31:15,183 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 02:31:15,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:15,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:15,184 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:31:15,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 02:31:15,441 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1072 statements into 76 equivalence classes. [2025-01-10 02:31:15,726 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 76 check-sat command(s) and asserted 1072 of 1072 statements. [2025-01-10 02:31:15,727 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 76 check-sat command(s) [2025-01-10 02:31:15,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:15,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 2000 conjuncts, 217 conjuncts are in the unsatisfiable core [2025-01-10 02:31:15,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 41934 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 27393 trivial. 0 not checked. [2025-01-10 02:31:16,544 INFO L312 TraceCheckSpWp]: Computing backward predicates...