./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Fibonacci02.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/Fibonacci02.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 b7261cadd839cd02322bb28945f92ad1bd2170c0a65dd385996b5ff81cbb1de7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:30:09,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:30:09,428 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,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:30:09,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:30:09,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:30:09,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:30:09,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:30:09,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:30:09,446 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:30:09,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:30:09,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:30:09,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:30:09,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:30:09,446 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:30:09,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:30:09,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:30:09,447 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:30:09,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:30:09,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:30:09,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:30:09,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:30:09,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:30:09,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:30:09,447 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:30:09,447 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:30:09,447 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:30:09,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:30:09,447 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:30:09,447 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:30:09,447 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:30:09,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:30:09,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:30:09,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:30:09,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:30:09,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:30:09,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:30:09,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:30:09,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:30:09,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:30:09,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:30:09,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:30:09,448 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:30:09,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:30:09,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:30:09,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:30:09,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:30:09,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:30:09,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:30:09,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:30:09,448 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 -> b7261cadd839cd02322bb28945f92ad1bd2170c0a65dd385996b5ff81cbb1de7 [2025-01-10 02:30:09,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:30:09,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:30:09,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:30:09,648 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:30:09,649 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:30:09,650 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci02.c [2025-01-10 02:30:10,846 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84d8a9334/aa29d882535145128cb964e3048ec30e/FLAG446e9a4b7 [2025-01-10 02:30:11,056 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:30:11,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c [2025-01-10 02:30:11,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84d8a9334/aa29d882535145128cb964e3048ec30e/FLAG446e9a4b7 [2025-01-10 02:30:11,434 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84d8a9334/aa29d882535145128cb964e3048ec30e [2025-01-10 02:30:11,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:30:11,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:30:11,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:30:11,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:30:11,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:30:11,462 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,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2334be49 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,463 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,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:30:11,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:30:11,676 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:30:11,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:30:11,715 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:30:11,715 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,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:30:11,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:30:11,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:30:11,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:30:11,724 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,734 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,743 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2025-01-10 02:30:11,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:30:11,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:30:11,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:30:11,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:30:11,748 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,748 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,749 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,754 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,754 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,755 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,756 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,756 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,757 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,757 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,758 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,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:30:11,759 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:30:11,759 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:30:11,759 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:30:11,759 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,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:30:11,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:11,779 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,781 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,797 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-01-10 02:30:11,797 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-01-10 02:30:11,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:30:11,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:30:11,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:30:11,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:30:11,840 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:30:11,841 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:30:11,934 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-10 02:30:11,934 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:30:11,941 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:30:11,941 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 02:30:11,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:30:11 BoogieIcfgContainer [2025-01-10 02:30:11,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:30:11,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:30:11,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:30:11,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:30:11,946 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:11,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18badea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:30:11, skipping insertion in model container [2025-01-10 02:30:11,947 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:11,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18badea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:30:11, skipping insertion in model container [2025-01-10 02:30:11,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:30:11" (3/3) ... [2025-01-10 02:30:11,948 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2025-01-10 02:30:11,957 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:30:11,958 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci02.c that has 2 procedures, 31 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-01-10 02:30:11,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:30:12,008 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;@30e9ec91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:30:12,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 02:30:12,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.45) internal successors, (29), 26 states have internal predecessors, (29), 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,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 02:30:12,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:12,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:12,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:30:12,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:12,024 INFO L85 PathProgramCache]: Analyzing trace with hash -106871919, now seen corresponding path program 1 times [2025-01-10 02:30:12,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:12,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42907854] [2025-01-10 02:30:12,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:12,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:12,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 02:30:12,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 02:30:12,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:12,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:12,177 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,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:12,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42907854] [2025-01-10 02:30:12,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42907854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:30:12,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:30:12,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:30:12,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146602352] [2025-01-10 02:30:12,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:30:12,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:30:12,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:12,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:30:12,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:30:12,199 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.45) internal successors, (29), 26 states have internal predecessors, (29), 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.0) internal successors, (6), 3 states have internal predecessors, (6), 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,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:12,230 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-01-10 02:30:12,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:30:12,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-01-10 02:30:12,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:12,236 INFO L225 Difference]: With dead ends: 36 [2025-01-10 02:30:12,236 INFO L226 Difference]: Without dead ends: 24 [2025-01-10 02:30:12,238 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,240 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 40 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,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 40 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,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-10 02:30:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-01-10 02:30:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 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,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-01-10 02:30:12,265 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2025-01-10 02:30:12,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:12,265 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-01-10 02:30:12,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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,265 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-01-10 02:30:12,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 02:30:12,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:12,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:12,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:30:12,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:30:12,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:12,267 INFO L85 PathProgramCache]: Analyzing trace with hash 981937849, now seen corresponding path program 1 times [2025-01-10 02:30:12,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:12,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860567351] [2025-01-10 02:30:12,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:12,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:12,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:30:12,275 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,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:12,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:12,313 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,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:12,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860567351] [2025-01-10 02:30:12,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860567351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:30:12,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:30:12,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:30:12,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368762105] [2025-01-10 02:30:12,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:30:12,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:30:12,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:12,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:30:12,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:30:12,316 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:12,410 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-01-10 02:30:12,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:30:12,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:12,412 INFO L225 Difference]: With dead ends: 24 [2025-01-10 02:30:12,412 INFO L226 Difference]: Without dead ends: 22 [2025-01-10 02:30:12,412 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,414 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:12,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:30:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-10 02:30:12,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-01-10 02:30:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 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,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-01-10 02:30:12,421 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 8 [2025-01-10 02:30:12,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:12,421 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-01-10 02:30:12,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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,421 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-01-10 02:30:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 02:30:12,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:12,422 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:12,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:30:12,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:30:12,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:12,423 INFO L85 PathProgramCache]: Analyzing trace with hash -590814878, now seen corresponding path program 1 times [2025-01-10 02:30:12,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:12,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408401604] [2025-01-10 02:30:12,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:12,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:12,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 02:30:12,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 02:30:12,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:12,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:12,604 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,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:12,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408401604] [2025-01-10 02:30:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408401604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:30:12,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:30:12,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:30:12,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47466783] [2025-01-10 02:30:12,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:30:12,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:30:12,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:12,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:30:12,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:30:12,609 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:12,648 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2025-01-10 02:30:12,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:30:12,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 29 [2025-01-10 02:30:12,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:12,649 INFO L225 Difference]: With dead ends: 34 [2025-01-10 02:30:12,649 INFO L226 Difference]: Without dead ends: 32 [2025-01-10 02:30:12,649 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:12,650 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:12,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:30:12,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-10 02:30:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-01-10 02:30:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 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:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-01-10 02:30:12,657 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 29 [2025-01-10 02:30:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:12,657 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-01-10 02:30:12,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-01-10 02:30:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 02:30:12,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:12,658 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] [2025-01-10 02:30:12,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:30:12,658 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:30:12,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:12,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1274820555, now seen corresponding path program 1 times [2025-01-10 02:30:12,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:12,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786174077] [2025-01-10 02:30:12,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:12,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:12,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:30:12,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:30:12,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:12,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:12,754 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:12,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:12,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786174077] [2025-01-10 02:30:12,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786174077] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:12,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336575746] [2025-01-10 02:30:12,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:12,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:12,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:12,757 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:12,775 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:12,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:30:12,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:30:12,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:12,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:12,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:30:12,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:12,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:13,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:30:13,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336575746] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:13,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:13,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-01-10 02:30:13,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167993649] [2025-01-10 02:30:13,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:13,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 02:30:13,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:13,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 02:30:13,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:30:13,046 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 15 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:30:13,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:13,321 INFO L93 Difference]: Finished difference Result 126 states and 180 transitions. [2025-01-10 02:30:13,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 02:30:13,321 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 24 [2025-01-10 02:30:13,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:13,322 INFO L225 Difference]: With dead ends: 126 [2025-01-10 02:30:13,323 INFO L226 Difference]: Without dead ends: 93 [2025-01-10 02:30:13,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-01-10 02:30:13,324 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 109 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:13,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 179 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:30:13,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-10 02:30:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2025-01-10 02:30:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 64 states have internal predecessors, (69), 11 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (32), 13 states have call predecessors, (32), 10 states have call successors, (32) [2025-01-10 02:30:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2025-01-10 02:30:13,337 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 24 [2025-01-10 02:30:13,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:13,337 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2025-01-10 02:30:13,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:30:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2025-01-10 02:30:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 02:30:13,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:13,338 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:13,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 02:30:13,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:13,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:30:13,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:13,544 INFO L85 PathProgramCache]: Analyzing trace with hash -103317130, now seen corresponding path program 2 times [2025-01-10 02:30:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:13,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907752447] [2025-01-10 02:30:13,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:13,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:13,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 02:30:13,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:30:13,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:13,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 02:30:13,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:13,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907752447] [2025-01-10 02:30:13,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907752447] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:13,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131214329] [2025-01-10 02:30:13,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:13,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:13,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:13,630 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:13,632 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:13,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 02:30:13,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:30:13,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:13,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:13,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:30:13,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 02:30:13,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:30:13,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131214329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:30:13,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:30:13,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-01-10 02:30:13,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216005362] [2025-01-10 02:30:13,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:30:13,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:30:13,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:13,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:30:13,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:30:13,691 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:13,715 INFO L93 Difference]: Finished difference Result 101 states and 141 transitions. [2025-01-10 02:30:13,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:30:13,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 30 [2025-01-10 02:30:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:13,717 INFO L225 Difference]: With dead ends: 101 [2025-01-10 02:30:13,717 INFO L226 Difference]: Without dead ends: 100 [2025-01-10 02:30:13,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 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:13,718 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 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:13,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 48 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:13,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-10 02:30:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2025-01-10 02:30:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 11 states have call successors, (11), 3 states have call predecessors, (11), 7 states have return successors, (39), 15 states have call predecessors, (39), 10 states have call successors, (39) [2025-01-10 02:30:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2025-01-10 02:30:13,731 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 30 [2025-01-10 02:30:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:13,731 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2025-01-10 02:30:13,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2025-01-10 02:30:13,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 02:30:13,732 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:13,732 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:13,737 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:13,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:13,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:30:13,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:13,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1092136320, now seen corresponding path program 1 times [2025-01-10 02:30:13,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:13,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422664571] [2025-01-10 02:30:13,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:13,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:13,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 02:30:13,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 02:30:13,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:13,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 02:30:14,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:14,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422664571] [2025-01-10 02:30:14,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422664571] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:14,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343549482] [2025-01-10 02:30:14,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:14,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:14,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:14,073 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,075 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,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 02:30:14,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 02:30:14,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:14,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:14,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:30:14,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:14,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:30:14,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343549482] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:14,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:14,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-01-10 02:30:14,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36897853] [2025-01-10 02:30:14,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:14,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 02:30:14,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:14,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 02:30:14,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-01-10 02:30:14,311 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:30:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:14,811 INFO L93 Difference]: Finished difference Result 287 states and 459 transitions. [2025-01-10 02:30:14,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 02:30:14,811 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2025-01-10 02:30:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:14,813 INFO L225 Difference]: With dead ends: 287 [2025-01-10 02:30:14,813 INFO L226 Difference]: Without dead ends: 209 [2025-01-10 02:30:14,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2025-01-10 02:30:14,815 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 140 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:14,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 324 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:30:14,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-10 02:30:14,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 175. [2025-01-10 02:30:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 137 states have (on average 1.094890510948905) internal successors, (150), 137 states have internal predecessors, (150), 22 states have call successors, (22), 6 states have call predecessors, (22), 14 states have return successors, (83), 31 states have call predecessors, (83), 21 states have call successors, (83) [2025-01-10 02:30:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 255 transitions. [2025-01-10 02:30:14,861 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 255 transitions. Word has length 31 [2025-01-10 02:30:14,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:14,861 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 255 transitions. [2025-01-10 02:30:14,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:30:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 255 transitions. [2025-01-10 02:30:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 02:30:14,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:14,862 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:14,871 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:15,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:15,066 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:30:15,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:15,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1255123334, now seen corresponding path program 1 times [2025-01-10 02:30:15,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:15,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223338903] [2025-01-10 02:30:15,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:15,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:15,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 02:30:15,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 02:30:15,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:15,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-01-10 02:30:15,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:15,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223338903] [2025-01-10 02:30:15,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223338903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:30:15,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:30:15,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:30:15,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516480940] [2025-01-10 02:30:15,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:30:15,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:30:15,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:15,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:30:15,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:30:15,138 INFO L87 Difference]: Start difference. First operand 175 states and 255 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:15,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:15,165 INFO L93 Difference]: Finished difference Result 189 states and 277 transitions. [2025-01-10 02:30:15,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:30:15,166 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 56 [2025-01-10 02:30:15,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:15,171 INFO L225 Difference]: With dead ends: 189 [2025-01-10 02:30:15,171 INFO L226 Difference]: Without dead ends: 188 [2025-01-10 02:30:15,171 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:15,172 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:15,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 83 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:30:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-10 02:30:15,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2025-01-10 02:30:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 143 states have (on average 1.0909090909090908) internal successors, (156), 142 states have internal predecessors, (156), 23 states have call successors, (23), 6 states have call predecessors, (23), 14 states have return successors, (89), 33 states have call predecessors, (89), 22 states have call successors, (89) [2025-01-10 02:30:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 268 transitions. [2025-01-10 02:30:15,191 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 268 transitions. Word has length 56 [2025-01-10 02:30:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:15,191 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 268 transitions. [2025-01-10 02:30:15,191 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:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 268 transitions. [2025-01-10 02:30:15,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-10 02:30:15,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:15,193 INFO L218 NwaCegarLoop]: trace histogram [9, 7, 6, 6, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:15,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:30:15,193 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:30:15,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:15,194 INFO L85 PathProgramCache]: Analyzing trace with hash -491141154, now seen corresponding path program 1 times [2025-01-10 02:30:15,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:15,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021181314] [2025-01-10 02:30:15,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:15,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:15,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-10 02:30:15,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 02:30:15,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:15,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-10 02:30:15,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:15,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021181314] [2025-01-10 02:30:15,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021181314] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:15,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736305049] [2025-01-10 02:30:15,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:15,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:15,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:15,251 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,252 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,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-10 02:30:15,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 02:30:15,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:15,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:15,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:30:15,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 67 proven. 70 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 02:30:15,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:15,639 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 138 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 02:30:15,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736305049] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:15,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:15,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 15, 15] total 26 [2025-01-10 02:30:15,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019182078] [2025-01-10 02:30:15,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:15,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 02:30:15,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:15,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 02:30:15,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2025-01-10 02:30:15,641 INFO L87 Difference]: Start difference. First operand 182 states and 268 transitions. Second operand has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 18 states have internal predecessors, (85), 13 states have call successors, (18), 10 states have call predecessors, (18), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-10 02:30:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:16,114 INFO L93 Difference]: Finished difference Result 531 states and 857 transitions. [2025-01-10 02:30:16,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 02:30:16,114 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 18 states have internal predecessors, (85), 13 states have call successors, (18), 10 states have call predecessors, (18), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) Word has length 67 [2025-01-10 02:30:16,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:16,116 INFO L225 Difference]: With dead ends: 531 [2025-01-10 02:30:16,116 INFO L226 Difference]: Without dead ends: 364 [2025-01-10 02:30:16,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 115 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=266, Invalid=1066, Unknown=0, NotChecked=0, Total=1332 [2025-01-10 02:30:16,119 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 295 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:16,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 490 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:30:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-01-10 02:30:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 332. [2025-01-10 02:30:16,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 262 states have (on average 1.0954198473282444) internal successors, (287), 260 states have internal predecessors, (287), 42 states have call successors, (42), 12 states have call predecessors, (42), 26 states have return successors, (130), 59 states have call predecessors, (130), 41 states have call successors, (130) [2025-01-10 02:30:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 459 transitions. [2025-01-10 02:30:16,148 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 459 transitions. Word has length 67 [2025-01-10 02:30:16,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:16,148 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 459 transitions. [2025-01-10 02:30:16,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 18 states have internal predecessors, (85), 13 states have call successors, (18), 10 states have call predecessors, (18), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-10 02:30:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 459 transitions. [2025-01-10 02:30:16,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-10 02:30:16,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:16,150 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:16,156 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:16,352 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:16,352 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:30:16,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:16,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1091030827, now seen corresponding path program 2 times [2025-01-10 02:30:16,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:16,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993698948] [2025-01-10 02:30:16,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:16,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:16,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-01-10 02:30:16,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 02:30:16,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:16,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-01-10 02:30:16,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:16,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993698948] [2025-01-10 02:30:16,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993698948] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:16,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782654261] [2025-01-10 02:30:16,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:16,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:16,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:16,488 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,489 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,511 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-01-10 02:30:16,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 02:30:16,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:16,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:16,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:30:16,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-01-10 02:30:16,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:16,603 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-01-10 02:30:16,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782654261] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:16,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:16,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 02:30:16,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550694950] [2025-01-10 02:30:16,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:16,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 02:30:16,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:16,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 02:30:16,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:30:16,605 INFO L87 Difference]: Start difference. First operand 332 states and 459 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 02:30:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:16,662 INFO L93 Difference]: Finished difference Result 353 states and 484 transitions. [2025-01-10 02:30:16,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:30:16,662 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 86 [2025-01-10 02:30:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:16,665 INFO L225 Difference]: With dead ends: 353 [2025-01-10 02:30:16,665 INFO L226 Difference]: Without dead ends: 352 [2025-01-10 02:30:16,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:30:16,666 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:16,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 106 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:30:16,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-01-10 02:30:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 332. [2025-01-10 02:30:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 262 states have (on average 1.0954198473282444) internal successors, (287), 260 states have internal predecessors, (287), 42 states have call successors, (42), 12 states have call predecessors, (42), 26 states have return successors, (130), 59 states have call predecessors, (130), 41 states have call successors, (130) [2025-01-10 02:30:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 459 transitions. [2025-01-10 02:30:16,712 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 459 transitions. Word has length 86 [2025-01-10 02:30:16,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:16,713 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 459 transitions. [2025-01-10 02:30:16,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 02:30:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 459 transitions. [2025-01-10 02:30:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-10 02:30:16,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:16,716 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:16,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 02:30:16,916 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,916 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:30:16,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:16,917 INFO L85 PathProgramCache]: Analyzing trace with hash -537782677, now seen corresponding path program 1 times [2025-01-10 02:30:16,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:16,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183677454] [2025-01-10 02:30:16,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:16,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:16,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 02:30:16,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 02:30:16,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:16,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 179 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 02:30:17,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:17,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183677454] [2025-01-10 02:30:17,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183677454] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:17,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984669796] [2025-01-10 02:30:17,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:17,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:17,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:17,230 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,238 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,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 02:30:17,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 02:30:17,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:17,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:17,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 02:30:17,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 179 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 02:30:17,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 179 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 02:30:17,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984669796] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:17,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:17,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 22 [2025-01-10 02:30:17,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136591152] [2025-01-10 02:30:17,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:17,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 02:30:17,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:17,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 02:30:17,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:30:17,597 INFO L87 Difference]: Start difference. First operand 332 states and 459 transitions. Second operand has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 14 states have internal predecessors, (67), 10 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:30:17,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:17,974 INFO L93 Difference]: Finished difference Result 627 states and 915 transitions. [2025-01-10 02:30:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-10 02:30:17,974 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 14 states have internal predecessors, (67), 10 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 87 [2025-01-10 02:30:17,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:17,976 INFO L225 Difference]: With dead ends: 627 [2025-01-10 02:30:17,976 INFO L226 Difference]: Without dead ends: 316 [2025-01-10 02:30:17,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 163 SyntacticMatches, 18 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=420, Invalid=1062, Unknown=0, NotChecked=0, Total=1482 [2025-01-10 02:30:17,979 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 411 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:17,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 148 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:30:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-01-10 02:30:17,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 292. [2025-01-10 02:30:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 229 states have (on average 1.091703056768559) internal successors, (250), 231 states have internal predecessors, (250), 37 states have call successors, (37), 12 states have call predecessors, (37), 24 states have return successors, (72), 48 states have call predecessors, (72), 36 states have call successors, (72) [2025-01-10 02:30:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 359 transitions. [2025-01-10 02:30:17,994 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 359 transitions. Word has length 87 [2025-01-10 02:30:17,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:17,994 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 359 transitions. [2025-01-10 02:30:17,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 14 states have internal predecessors, (67), 10 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:30:17,995 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 359 transitions. [2025-01-10 02:30:17,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-10 02:30:17,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:17,995 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:18,001 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:18,200 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:18,200 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:30:18,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:18,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1462106636, now seen corresponding path program 2 times [2025-01-10 02:30:18,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:18,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472143273] [2025-01-10 02:30:18,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:18,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:18,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-01-10 02:30:18,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-01-10 02:30:18,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:18,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-01-10 02:30:18,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472143273] [2025-01-10 02:30:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472143273] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598216423] [2025-01-10 02:30:18,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:18,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:18,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:18,300 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,301 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,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-01-10 02:30:18,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-01-10 02:30:18,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:18,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:18,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:30:18,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2025-01-10 02:30:18,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-01-10 02:30:18,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598216423] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:18,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:18,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-01-10 02:30:18,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451575801] [2025-01-10 02:30:18,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:18,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 02:30:18,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:18,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 02:30:18,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:30:18,499 INFO L87 Difference]: Start difference. First operand 292 states and 359 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 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:18,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:18,583 INFO L93 Difference]: Finished difference Result 302 states and 371 transitions. [2025-01-10 02:30:18,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 02:30:18,583 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 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 81 [2025-01-10 02:30:18,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:18,585 INFO L225 Difference]: With dead ends: 302 [2025-01-10 02:30:18,585 INFO L226 Difference]: Without dead ends: 300 [2025-01-10 02:30:18,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-01-10 02:30:18,585 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:18,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 133 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:30:18,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-01-10 02:30:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 292. [2025-01-10 02:30:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 229 states have (on average 1.0829694323144106) internal successors, (248), 231 states have internal predecessors, (248), 37 states have call successors, (37), 12 states have call predecessors, (37), 24 states have return successors, (72), 48 states have call predecessors, (72), 36 states have call successors, (72) [2025-01-10 02:30:18,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 357 transitions. [2025-01-10 02:30:18,599 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 357 transitions. Word has length 81 [2025-01-10 02:30:18,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:18,599 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 357 transitions. [2025-01-10 02:30:18,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 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:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2025-01-10 02:30:18,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 02:30:18,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:18,600 INFO L218 NwaCegarLoop]: trace histogram [13, 10, 9, 9, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 02:30:18,606 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:18,804 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:18,804 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:30:18,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:18,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2138334643, now seen corresponding path program 3 times [2025-01-10 02:30:18,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:18,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72946363] [2025-01-10 02:30:18,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:30:18,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:18,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 11 equivalence classes. [2025-01-10 02:30:18,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 98 statements. [2025-01-10 02:30:18,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 02:30:18,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 73 proven. 3 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-01-10 02:30:18,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:18,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72946363] [2025-01-10 02:30:18,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72946363] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:18,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248782081] [2025-01-10 02:30:18,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:30:18,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:18,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:18,846 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:18,848 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:18,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 11 equivalence classes. [2025-01-10 02:30:18,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 98 statements. [2025-01-10 02:30:18,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 02:30:18,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:18,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:30:18,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-01-10 02:30:18,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:30:18,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248782081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:30:18,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:30:18,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-01-10 02:30:18,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244620896] [2025-01-10 02:30:18,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:30:18,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:30:18,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:18,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:30:18,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:30:18,899 INFO L87 Difference]: Start difference. First operand 292 states and 357 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 02:30:18,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:18,954 INFO L93 Difference]: Finished difference Result 458 states and 587 transitions. [2025-01-10 02:30:18,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:30:18,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 98 [2025-01-10 02:30:18,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:18,956 INFO L225 Difference]: With dead ends: 458 [2025-01-10 02:30:18,956 INFO L226 Difference]: Without dead ends: 187 [2025-01-10 02:30:18,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:30:18,958 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:18,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 36 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:30:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-10 02:30:18,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2025-01-10 02:30:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 146 states have (on average 1.1232876712328768) internal successors, (164), 148 states have internal predecessors, (164), 25 states have call successors, (25), 12 states have call predecessors, (25), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 02:30:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 213 transitions. [2025-01-10 02:30:18,970 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 213 transitions. Word has length 98 [2025-01-10 02:30:18,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:18,970 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 213 transitions. [2025-01-10 02:30:18,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 02:30:18,970 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 213 transitions. [2025-01-10 02:30:18,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-10 02:30:18,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:18,971 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1] [2025-01-10 02:30:18,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 02:30:19,177 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:19,177 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:30:19,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:19,178 INFO L85 PathProgramCache]: Analyzing trace with hash 184820579, now seen corresponding path program 4 times [2025-01-10 02:30:19,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:19,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291506176] [2025-01-10 02:30:19,178 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 02:30:19,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:19,184 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 113 statements into 2 equivalence classes. [2025-01-10 02:30:19,193 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-01-10 02:30:19,193 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 02:30:19,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 35 proven. 23 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2025-01-10 02:30:19,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:19,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291506176] [2025-01-10 02:30:19,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291506176] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:19,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987499300] [2025-01-10 02:30:19,412 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 02:30:19,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:19,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:19,415 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:19,419 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:19,441 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 113 statements into 2 equivalence classes. [2025-01-10 02:30:19,460 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-01-10 02:30:19,460 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 02:30:19,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:19,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 02:30:19,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 29 proven. 42 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 02:30:19,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-10 02:30:19,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987499300] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:19,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:19,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 13] total 22 [2025-01-10 02:30:19,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666797927] [2025-01-10 02:30:19,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:19,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 02:30:19,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:19,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 02:30:19,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2025-01-10 02:30:19,895 INFO L87 Difference]: Start difference. First operand 185 states and 213 transitions. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 5 states have call successors, (6), 1 states have call predecessors, (6), 7 states have return successors, (14), 13 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-10 02:30:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:19,955 INFO L93 Difference]: Finished difference Result 185 states and 213 transitions. [2025-01-10 02:30:19,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 02:30:19,956 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 5 states have call successors, (6), 1 states have call predecessors, (6), 7 states have return successors, (14), 13 states have call predecessors, (14), 5 states have call successors, (14) Word has length 113 [2025-01-10 02:30:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:19,957 INFO L225 Difference]: With dead ends: 185 [2025-01-10 02:30:19,957 INFO L226 Difference]: Without dead ends: 184 [2025-01-10 02:30:19,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 215 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2025-01-10 02:30:19,959 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:19,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 214 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:30:19,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-10 02:30:19,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-01-10 02:30:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 146 states have (on average 1.0616438356164384) internal successors, (155), 147 states have internal predecessors, (155), 25 states have call successors, (25), 12 states have call predecessors, (25), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 02:30:19,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 204 transitions. [2025-01-10 02:30:19,979 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 204 transitions. Word has length 113 [2025-01-10 02:30:19,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:19,979 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 204 transitions. [2025-01-10 02:30:19,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 5 states have call successors, (6), 1 states have call predecessors, (6), 7 states have return successors, (14), 13 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-10 02:30:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 204 transitions. [2025-01-10 02:30:19,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-10 02:30:19,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:19,980 INFO L218 NwaCegarLoop]: trace histogram [19, 16, 14, 11, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 1, 1, 1, 1] [2025-01-10 02:30:19,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 02:30:20,180 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:20,181 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:30:20,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:20,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1295574535, now seen corresponding path program 3 times [2025-01-10 02:30:20,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:20,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890960999] [2025-01-10 02:30:20,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:30:20,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:20,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 167 statements into 16 equivalence classes. [2025-01-10 02:30:20,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 137 of 167 statements. [2025-01-10 02:30:20,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 02:30:20,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 88 proven. 189 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2025-01-10 02:30:20,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:20,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890960999] [2025-01-10 02:30:20,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890960999] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:20,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938845213] [2025-01-10 02:30:20,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:30:20,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:20,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:20,600 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:20,602 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:20,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 167 statements into 16 equivalence classes. [2025-01-10 02:30:20,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 137 of 167 statements. [2025-01-10 02:30:20,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 02:30:20,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:20,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 02:30:20,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2025-01-10 02:30:20,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 144 proven. 128 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-10 02:30:21,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938845213] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:21,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:21,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 17] total 32 [2025-01-10 02:30:21,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728831803] [2025-01-10 02:30:21,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:21,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-10 02:30:21,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:21,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-10 02:30:21,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=802, Unknown=0, NotChecked=0, Total=1056 [2025-01-10 02:30:21,742 INFO L87 Difference]: Start difference. First operand 184 states and 204 transitions. Second operand has 33 states, 32 states have (on average 2.71875) internal successors, (87), 33 states have internal predecessors, (87), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (22), 22 states have call predecessors, (22), 8 states have call successors, (22) [2025-01-10 02:30:21,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:21,823 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2025-01-10 02:30:21,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 02:30:21,824 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 33 states have internal predecessors, (87), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (22), 22 states have call predecessors, (22), 8 states have call successors, (22) Word has length 167 [2025-01-10 02:30:21,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:21,825 INFO L225 Difference]: With dead ends: 185 [2025-01-10 02:30:21,825 INFO L226 Difference]: Without dead ends: 184 [2025-01-10 02:30:21,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 317 SyntacticMatches, 13 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=902, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 02:30:21,826 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:21,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 219 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:30:21,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-10 02:30:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-01-10 02:30:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 146 states have (on average 1.0342465753424657) internal successors, (151), 147 states have internal predecessors, (151), 25 states have call successors, (25), 12 states have call predecessors, (25), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 02:30:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 200 transitions. [2025-01-10 02:30:21,832 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 200 transitions. Word has length 167 [2025-01-10 02:30:21,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:21,833 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 200 transitions. [2025-01-10 02:30:21,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 33 states have internal predecessors, (87), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (22), 22 states have call predecessors, (22), 8 states have call successors, (22) [2025-01-10 02:30:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 200 transitions. [2025-01-10 02:30:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-01-10 02:30:21,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:21,835 INFO L218 NwaCegarLoop]: trace histogram [43, 40, 35, 22, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 20, 19, 13, 8, 1, 1, 1, 1] [2025-01-10 02:30:21,841 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:22,040 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:22,040 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:30:22,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:22,040 INFO L85 PathProgramCache]: Analyzing trace with hash 333558980, now seen corresponding path program 4 times [2025-01-10 02:30:22,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:22,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330716995] [2025-01-10 02:30:22,041 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 02:30:22,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:22,052 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 410 statements into 2 equivalence classes. [2025-01-10 02:30:22,079 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 410 of 410 statements. [2025-01-10 02:30:22,079 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 02:30:22,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2025-01-10 02:30:23,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:23,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330716995] [2025-01-10 02:30:23,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330716995] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:23,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090709251] [2025-01-10 02:30:23,880 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 02:30:23,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:23,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:23,883 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:23,885 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:23,931 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 410 statements into 2 equivalence classes. [2025-01-10 02:30:23,992 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 410 of 410 statements. [2025-01-10 02:30:23,993 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 02:30:23,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:23,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-01-10 02:30:24,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:24,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2025-01-10 02:30:24,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 1149 proven. 1015 refuted. 0 times theorem prover too weak. 3820 trivial. 0 not checked. [2025-01-10 02:30:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090709251] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:29,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:29,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 29] total 40 [2025-01-10 02:30:29,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333250546] [2025-01-10 02:30:29,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:29,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-10 02:30:29,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:29,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-10 02:30:29,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2025-01-10 02:30:29,989 INFO L87 Difference]: Start difference. First operand 184 states and 200 transitions. Second operand has 41 states, 40 states have (on average 2.625) internal successors, (105), 41 states have internal predecessors, (105), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) [2025-01-10 02:30:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:30,099 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2025-01-10 02:30:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 02:30:30,100 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.625) internal successors, (105), 41 states have internal predecessors, (105), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) Word has length 410 [2025-01-10 02:30:30,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:30,103 INFO L225 Difference]: With dead ends: 185 [2025-01-10 02:30:30,103 INFO L226 Difference]: Without dead ends: 184 [2025-01-10 02:30:30,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 798 SyntacticMatches, 62 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1632 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2025-01-10 02:30:30,105 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:30,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 177 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:30:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-10 02:30:30,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-01-10 02:30:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 147 states have internal predecessors, (148), 25 states have call successors, (25), 12 states have call predecessors, (25), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 02:30:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 197 transitions. [2025-01-10 02:30:30,117 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 197 transitions. Word has length 410 [2025-01-10 02:30:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:30,118 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 197 transitions. [2025-01-10 02:30:30,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.625) internal successors, (105), 41 states have internal predecessors, (105), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) [2025-01-10 02:30:30,118 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 197 transitions. [2025-01-10 02:30:30,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1066 [2025-01-10 02:30:30,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:30,140 INFO L218 NwaCegarLoop]: trace histogram [109, 108, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 34, 21, 1, 1, 1, 1] [2025-01-10 02:30:30,146 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:30,340 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:30,342 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:30:30,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:30,343 INFO L85 PathProgramCache]: Analyzing trace with hash -297717462, now seen corresponding path program 5 times [2025-01-10 02:30:30,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:30,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887306160] [2025-01-10 02:30:30,344 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 02:30:30,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:30,377 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1065 statements into 83 equivalence classes. [2025-01-10 02:30:30,589 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 83 check-sat command(s) and asserted 1065 of 1065 statements. [2025-01-10 02:30:30,589 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 83 check-sat command(s) [2025-01-10 02:30:30,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 7413 proven. 10308 refuted. 0 times theorem prover too weak. 23745 trivial. 0 not checked. [2025-01-10 02:30:44,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:44,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887306160] [2025-01-10 02:30:44,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887306160] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:44,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125529649] [2025-01-10 02:30:44,852 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 02:30:44,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:44,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:44,854 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:44,856 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:44,986 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1065 statements into 83 equivalence classes. [2025-01-10 02:30:45,251 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 83 check-sat command(s) and asserted 1065 of 1065 statements. [2025-01-10 02:30:45,251 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 83 check-sat command(s) [2025-01-10 02:30:45,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:45,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 1988 conjuncts, 217 conjuncts are in the unsatisfiable core [2025-01-10 02:30:45,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2025-01-10 02:30:46,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 7863 proven. 7392 refuted. 0 times theorem prover too weak. 26211 trivial. 0 not checked. [2025-01-10 02:31:21,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125529649] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:21,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:21,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 41] total 60 [2025-01-10 02:31:21,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340185971] [2025-01-10 02:31:21,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:21,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-01-10 02:31:21,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:21,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-01-10 02:31:21,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=2848, Unknown=0, NotChecked=0, Total=3660 [2025-01-10 02:31:21,515 INFO L87 Difference]: Start difference. First operand 184 states and 197 transitions. Second operand has 61 states, 60 states have (on average 2.5833333333333335) internal successors, (155), 61 states have internal predecessors, (155), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (42), 42 states have call predecessors, (42), 16 states have call successors, (42) [2025-01-10 02:31:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:21,598 INFO L93 Difference]: Finished difference Result 184 states and 197 transitions. [2025-01-10 02:31:21,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-10 02:31:21,598 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.5833333333333335) internal successors, (155), 61 states have internal predecessors, (155), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (42), 42 states have call predecessors, (42), 16 states have call successors, (42) Word has length 1065 [2025-01-10 02:31:21,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:21,600 INFO L225 Difference]: With dead ends: 184 [2025-01-10 02:31:21,600 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:31:21,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2346 GetRequests, 2094 SyntacticMatches, 192 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7041 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=852, Invalid=2930, Unknown=0, NotChecked=0, Total=3782 [2025-01-10 02:31:21,601 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:21,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 248 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:31:21,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:31:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:31:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:31:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:31:21,602 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1065 [2025-01-10 02:31:21,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:21,603 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:31:21,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.5833333333333335) internal successors, (155), 61 states have internal predecessors, (155), 16 states have call successors, (17), 1 states have call predecessors, (17), 17 states have return successors, (42), 42 states have call predecessors, (42), 16 states have call successors, (42) [2025-01-10 02:31:21,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:31:21,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:31:21,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-01-10 02:31:21,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 02:31:21,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 02:31:21,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 02:31:21,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 02:31:21,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-01-10 02:31:21,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 02:31:21,810 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:31:21,812 INFO L422 BasicCegarLoop]: Path program histogram: [5, 4, 2, 1, 1, 1, 1, 1] [2025-01-10 02:31:21,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:31:22,745 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:31:22,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:31:22 BoogieIcfgContainer [2025-01-10 02:31:22,748 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:31:22,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:31:22,749 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:31:22,749 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:31:22,750 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:30:11" (3/4) ... [2025-01-10 02:31:22,751 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 02:31:22,755 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2025-01-10 02:31:22,758 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-10 02:31:22,758 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 02:31:22,758 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 02:31:22,758 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 02:31:22,802 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:31:22,802 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:31:22,802 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:31:22,803 INFO L158 Benchmark]: Toolchain (without parser) took 71348.06ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 107.0MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 148.5MB. Max. memory is 16.1GB. [2025-01-10 02:31:22,803 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 226.5MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:31:22,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.42ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 96.6MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:31:22,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.71ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.7MB in the end (delta: 916.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:31:22,804 INFO L158 Benchmark]: Boogie Preprocessor took 14.93ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.8MB in the end (delta: 912.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:31:22,804 INFO L158 Benchmark]: RCFGBuilder took 182.84ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 84.6MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:31:22,804 INFO L158 Benchmark]: TraceAbstraction took 70805.60ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 83.7MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-01-10 02:31:22,804 INFO L158 Benchmark]: Witness Printer took 53.44ms. Allocated memory is still 2.1GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:31:22,805 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 226.5MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.42ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 96.6MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.71ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.7MB in the end (delta: 916.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.93ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.8MB in the end (delta: 912.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 182.84ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 84.6MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 70805.60ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 83.7MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 53.44ms. Allocated memory is still 2.1GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 69.8s, OverallIterations: 16, TraceHistogramMax: 109, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1079 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1050 mSDsluCounter, 2526 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2114 mSDsCounter, 266 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2964 IncrementalHoareTripleChecker+Invalid, 3230 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 266 mSolverCounterUnsat, 412 mSDtfsCounter, 2964 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4875 GetRequests, 4247 SyntacticMatches, 302 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10538 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=8, InterpolantAutomatonStates: 212, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 158 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 63.0s InterpolantComputationTime, 4618 NumberOfCodeBlocks, 4430 NumberOfCodeBlocksAsserted, 228 NumberOfCheckSat, 6711 ConstructedInterpolants, 0 QuantifiedInterpolants, 15802 SizeOfPredicates, 19 NumberOfNonLiveVariables, 4218 ConjunctsInSsa, 413 ConjunctsInUnsatCore, 38 InterpolantComputations, 6 PerfectInterpolantSequences, 120649/150686 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 02:31:22,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE