./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0724aefed4fd629206cc51e19e964e04af92729823366947a0cfe01fe4e4d102 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:31:50,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:31:50,314 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:31:50,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:31:50,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:31:50,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:31:50,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:31:50,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:31:50,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:31:50,351 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:31:50,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:31:50,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:31:50,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:31:50,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:31:50,353 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:31:50,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:31:50,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:31:50,353 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:31:50,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:31:50,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:31:50,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:31:50,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:31:50,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:31:50,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:31:50,354 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:31:50,354 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:31:50,354 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:31:50,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:31:50,354 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:31:50,354 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:31:50,354 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:31:50,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:31:50,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:31:50,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:31:50,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:31:50,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:31:50,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:31:50,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:31:50,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:31:50,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:31:50,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:31:50,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:31:50,355 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:31:50,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:31:50,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:31:50,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:31:50,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:31:50,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:31:50,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:31:50,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:31:50,356 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 -> 0724aefed4fd629206cc51e19e964e04af92729823366947a0cfe01fe4e4d102 [2025-01-10 02:31:50,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:31:50,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:31:50,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:31:50,571 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:31:50,571 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:31:50,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2025-01-10 02:31:51,807 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c005ecc2/32b555acdaea4c699ca12a8eba6d379a/FLAG508b74795 [2025-01-10 02:31:52,084 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:31:52,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2025-01-10 02:31:52,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c005ecc2/32b555acdaea4c699ca12a8eba6d379a/FLAG508b74795 [2025-01-10 02:31:52,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c005ecc2/32b555acdaea4c699ca12a8eba6d379a [2025-01-10 02:31:52,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:31:52,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:31:52,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:31:52,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:31:52,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:31:52,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:31:52" (1/1) ... [2025-01-10 02:31:52,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c0dad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:52, skipping insertion in model container [2025-01-10 02:31:52,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:31:52" (1/1) ... [2025-01-10 02:31:52,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:31:52,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:31:52,595 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:31:52,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:31:52,637 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:31:52,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:52 WrapperNode [2025-01-10 02:31:52,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:31:52,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:31:52,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:31:52,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:31:52,650 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:31:52" (1/1) ... [2025-01-10 02:31:52,657 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:31:52" (1/1) ... [2025-01-10 02:31:52,674 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2025-01-10 02:31:52,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:31:52,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:31:52,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:31:52,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:31:52,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:52" (1/1) ... [2025-01-10 02:31:52,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:52" (1/1) ... [2025-01-10 02:31:52,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:52" (1/1) ... [2025-01-10 02:31:52,710 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:31:52,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:52" (1/1) ... [2025-01-10 02:31:52,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:52" (1/1) ... [2025-01-10 02:31:52,712 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:52" (1/1) ... [2025-01-10 02:31:52,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:52" (1/1) ... [2025-01-10 02:31:52,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:52" (1/1) ... [2025-01-10 02:31:52,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:52" (1/1) ... [2025-01-10 02:31:52,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:52" (1/1) ... [2025-01-10 02:31:52,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:31:52,719 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:31:52,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:31:52,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:31:52,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:52" (1/1) ... [2025-01-10 02:31:52,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:31:52,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:52,768 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:31:52,773 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:31:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:31:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:31:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2025-01-10 02:31:52,807 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2025-01-10 02:31:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2025-01-10 02:31:52,807 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2025-01-10 02:31:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:31:52,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:31:52,880 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:31:52,885 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:31:53,039 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-10 02:31:53,041 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:31:53,053 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:31:53,053 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 02:31:53,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:31:53 BoogieIcfgContainer [2025-01-10 02:31:53,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:31:53,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:31:53,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:31:53,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:31:53,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:31:52" (1/3) ... [2025-01-10 02:31:53,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124a4d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:31:53, skipping insertion in model container [2025-01-10 02:31:53,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:31:52" (2/3) ... [2025-01-10 02:31:53,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124a4d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:31:53, skipping insertion in model container [2025-01-10 02:31:53,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:31:53" (3/3) ... [2025-01-10 02:31:53,060 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2025-01-10 02:31:53,077 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:31:53,078 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_2calls_4-1.c that has 3 procedures, 53 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-01-10 02:31:53,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:31:53,117 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;@30ffd46e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:31:53,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-10 02:31:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 45 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:31:53,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 02:31:53,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:53,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:53,125 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:31:53,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:53,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1867028009, now seen corresponding path program 1 times [2025-01-10 02:31:53,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:53,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405432381] [2025-01-10 02:31:53,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:53,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:53,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 02:31:53,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 02:31:53,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:53,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:53,263 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:31:53,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:53,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405432381] [2025-01-10 02:31:53,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405432381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:53,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:31:53,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:31:53,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290980232] [2025-01-10 02:31:53,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:53,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:31:53,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:53,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:31:53,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:31:53,283 INFO L87 Difference]: Start difference. First operand has 53 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 45 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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:31:53,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:53,326 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-01-10 02:31:53,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:31:53,327 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:31:53,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:53,332 INFO L225 Difference]: With dead ends: 59 [2025-01-10 02:31:53,333 INFO L226 Difference]: Without dead ends: 45 [2025-01-10 02:31:53,334 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:31:53,338 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 11 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 92 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:31:53,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 92 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:31:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-10 02:31:53,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-01-10 02:31:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 36 states have internal predecessors, (40), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:31:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-01-10 02:31:53,371 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 7 [2025-01-10 02:31:53,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:53,371 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-01-10 02:31:53,371 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:31:53,371 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-01-10 02:31:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 02:31:53,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:53,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:53,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:31:53,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:31:53,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:53,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2043293518, now seen corresponding path program 1 times [2025-01-10 02:31:53,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:53,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127526983] [2025-01-10 02:31:53,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:53,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:53,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:31:53,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:31:53,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:53,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:53,425 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:31:53,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:53,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127526983] [2025-01-10 02:31:53,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127526983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:53,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:31:53,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:31:53,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046018165] [2025-01-10 02:31:53,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:53,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:31:53,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:53,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:31:53,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:31:53,427 INFO L87 Difference]: Start difference. First operand 43 states and 49 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:31:53,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:53,477 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2025-01-10 02:31:53,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:31:53,478 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:31:53,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:53,478 INFO L225 Difference]: With dead ends: 64 [2025-01-10 02:31:53,479 INFO L226 Difference]: Without dead ends: 58 [2025-01-10 02:31:53,479 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:31:53,479 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 26 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:53,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 164 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:31:53,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-10 02:31:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-01-10 02:31:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 46 states have internal predecessors, (52), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:31:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2025-01-10 02:31:53,486 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 8 [2025-01-10 02:31:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:53,486 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2025-01-10 02:31:53,486 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:31:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2025-01-10 02:31:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 02:31:53,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:53,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:53,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:31:53,487 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:31:53,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:53,490 INFO L85 PathProgramCache]: Analyzing trace with hash -749725533, now seen corresponding path program 1 times [2025-01-10 02:31:53,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:53,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588023214] [2025-01-10 02:31:53,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:53,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:53,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 02:31:53,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 02:31:53,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:53,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:53,517 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:31:53,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:53,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588023214] [2025-01-10 02:31:53,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588023214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:53,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:31:53,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:31:53,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924868923] [2025-01-10 02:31:53,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:53,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:31:53,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:53,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:31:53,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:31:53,519 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:31:53,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:53,536 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2025-01-10 02:31:53,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:31:53,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 02:31:53,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:53,537 INFO L225 Difference]: With dead ends: 58 [2025-01-10 02:31:53,537 INFO L226 Difference]: Without dead ends: 56 [2025-01-10 02:31:53,538 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:31:53,538 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 72 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:31:53,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 72 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:31:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-10 02:31:53,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-01-10 02:31:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 44 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:31:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-01-10 02:31:53,544 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 13 [2025-01-10 02:31:53,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:53,544 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-01-10 02:31:53,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:31:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-01-10 02:31:53,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 02:31:53,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:53,544 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:53,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:31:53,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:31:53,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:53,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1766654982, now seen corresponding path program 1 times [2025-01-10 02:31:53,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:53,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77369342] [2025-01-10 02:31:53,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:53,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:53,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:31:53,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:31:53,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:53,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:53,611 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:31:53,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:53,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77369342] [2025-01-10 02:31:53,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77369342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:53,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:31:53,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:31:53,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264301820] [2025-01-10 02:31:53,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:53,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:31:53,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:53,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:31:53,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:31:53,613 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:31:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:53,712 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2025-01-10 02:31:53,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:31:53,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 02:31:53,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:53,713 INFO L225 Difference]: With dead ends: 58 [2025-01-10 02:31:53,713 INFO L226 Difference]: Without dead ends: 54 [2025-01-10 02:31:53,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:31:53,714 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:53,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 102 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:31:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-10 02:31:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2025-01-10 02:31:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 40 states have internal predecessors, (46), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:31:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-01-10 02:31:53,721 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 14 [2025-01-10 02:31:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:53,721 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-01-10 02:31:53,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:31:53,721 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-01-10 02:31:53,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 02:31:53,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:53,722 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:53,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:31:53,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:31:53,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:53,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2097999453, now seen corresponding path program 1 times [2025-01-10 02:31:53,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:53,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63964577] [2025-01-10 02:31:53,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:53,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:53,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 02:31:53,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 02:31:53,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:53,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:31:53,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:53,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63964577] [2025-01-10 02:31:53,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63964577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:53,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:31:53,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:31:53,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671262561] [2025-01-10 02:31:53,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:53,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:31:53,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:53,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:31:53,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:31:53,823 INFO L87 Difference]: Start difference. First operand 50 states and 59 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:31:53,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:53,862 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2025-01-10 02:31:53,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:31:53,862 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 23 [2025-01-10 02:31:53,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:53,863 INFO L225 Difference]: With dead ends: 74 [2025-01-10 02:31:53,863 INFO L226 Difference]: Without dead ends: 69 [2025-01-10 02:31:53,864 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:31:53,864 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:53,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 115 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:31:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-10 02:31:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-01-10 02:31:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2025-01-10 02:31:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2025-01-10 02:31:53,872 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 23 [2025-01-10 02:31:53,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:53,872 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2025-01-10 02:31:53,872 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:31:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2025-01-10 02:31:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 02:31:53,873 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:53,873 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:53,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:31:53,873 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:31:53,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:53,874 INFO L85 PathProgramCache]: Analyzing trace with hash 624421350, now seen corresponding path program 1 times [2025-01-10 02:31:53,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:53,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765370593] [2025-01-10 02:31:53,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:53,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:53,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:31:53,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:31:53,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:53,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:31:53,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:53,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765370593] [2025-01-10 02:31:53,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765370593] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:53,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651112778] [2025-01-10 02:31:53,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:53,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:53,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:53,966 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:31:53,968 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:31:53,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:31:53,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:31:53,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:53,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:54,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:31:54,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:31:54,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:31:54,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651112778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:54,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:31:54,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2025-01-10 02:31:54,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103111827] [2025-01-10 02:31:54,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:54,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:31:54,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:54,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:31:54,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:31:54,066 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:31:54,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:54,161 INFO L93 Difference]: Finished difference Result 113 states and 140 transitions. [2025-01-10 02:31:54,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:31:54,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-01-10 02:31:54,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:54,162 INFO L225 Difference]: With dead ends: 113 [2025-01-10 02:31:54,163 INFO L226 Difference]: Without dead ends: 63 [2025-01-10 02:31:54,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:31:54,164 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:54,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 153 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:31:54,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-10 02:31:54,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2025-01-10 02:31:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 47 states have internal predecessors, (53), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2025-01-10 02:31:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2025-01-10 02:31:54,174 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 24 [2025-01-10 02:31:54,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:54,177 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2025-01-10 02:31:54,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:31:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2025-01-10 02:31:54,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 02:31:54,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:54,178 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:54,187 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:31:54,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:54,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:31:54,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:54,380 INFO L85 PathProgramCache]: Analyzing trace with hash 120521327, now seen corresponding path program 1 times [2025-01-10 02:31:54,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:54,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183345577] [2025-01-10 02:31:54,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:54,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:31:54,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:31:54,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:54,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:31:54,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:54,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183345577] [2025-01-10 02:31:54,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183345577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:54,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:31:54,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:31:54,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350393807] [2025-01-10 02:31:54,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:54,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:31:54,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:54,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:31:54,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:31:54,452 INFO L87 Difference]: Start difference. First operand 59 states and 71 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), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:31:54,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:54,493 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2025-01-10 02:31:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:31:54,493 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), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-01-10 02:31:54,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:54,494 INFO L225 Difference]: With dead ends: 83 [2025-01-10 02:31:54,494 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 02:31:54,495 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:31:54,495 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:54,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 151 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:31:54,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 02:31:54,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2025-01-10 02:31:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 55 states have internal predecessors, (60), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (19), 10 states have call predecessors, (19), 9 states have call successors, (19) [2025-01-10 02:31:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2025-01-10 02:31:54,501 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 25 [2025-01-10 02:31:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:54,502 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2025-01-10 02:31:54,502 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), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:31:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2025-01-10 02:31:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 02:31:54,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:54,503 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:54,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:31:54,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:31:54,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:54,503 INFO L85 PathProgramCache]: Analyzing trace with hash -473230649, now seen corresponding path program 1 times [2025-01-10 02:31:54,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:54,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327874942] [2025-01-10 02:31:54,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:54,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:54,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 02:31:54,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 02:31:54,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:54,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:31:54,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:54,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327874942] [2025-01-10 02:31:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327874942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:54,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:31:54,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:31:54,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801711203] [2025-01-10 02:31:54,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:54,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:31:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:54,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:31:54,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:31:54,550 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:31:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:54,579 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2025-01-10 02:31:54,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:31:54,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 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:31:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:54,581 INFO L225 Difference]: With dead ends: 83 [2025-01-10 02:31:54,581 INFO L226 Difference]: Without dead ends: 81 [2025-01-10 02:31:54,581 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:31:54,582 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 3 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:54,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 156 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:31:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-10 02:31:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-01-10 02:31:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 62 states have internal predecessors, (67), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (23), 12 states have call predecessors, (23), 10 states have call successors, (23) [2025-01-10 02:31:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2025-01-10 02:31:54,609 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 29 [2025-01-10 02:31:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:54,609 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2025-01-10 02:31:54,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:31:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2025-01-10 02:31:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 02:31:54,610 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:54,610 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:54,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:31:54,610 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:31:54,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:54,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1773385638, now seen corresponding path program 1 times [2025-01-10 02:31:54,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:54,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761282795] [2025-01-10 02:31:54,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:54,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:54,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:31:54,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:31:54,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:54,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:54,659 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:31:54,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:54,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761282795] [2025-01-10 02:31:54,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761282795] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:54,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702663072] [2025-01-10 02:31:54,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:54,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:54,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:54,662 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:31:54,663 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:31:54,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:31:54,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:31:54,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:54,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:54,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:31:54,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:54,779 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:31:54,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:54,933 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:31:54,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702663072] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:54,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:54,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-01-10 02:31:54,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735308449] [2025-01-10 02:31:54,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:54,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 02:31:54,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:54,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 02:31:54,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-01-10 02:31:54,935 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 19 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 15 states have internal predecessors, (59), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:31:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:55,192 INFO L93 Difference]: Finished difference Result 187 states and 250 transitions. [2025-01-10 02:31:55,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 02:31:55,192 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 15 states have internal predecessors, (59), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 30 [2025-01-10 02:31:55,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:55,194 INFO L225 Difference]: With dead ends: 187 [2025-01-10 02:31:55,194 INFO L226 Difference]: Without dead ends: 118 [2025-01-10 02:31:55,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-01-10 02:31:55,195 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 128 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:55,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 398 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:31:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-10 02:31:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2025-01-10 02:31:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 80 states have (on average 1.1625) internal successors, (93), 85 states have internal predecessors, (93), 14 states have call successors, (14), 5 states have call predecessors, (14), 8 states have return successors, (32), 15 states have call predecessors, (32), 13 states have call successors, (32) [2025-01-10 02:31:55,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2025-01-10 02:31:55,208 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 30 [2025-01-10 02:31:55,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:55,208 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2025-01-10 02:31:55,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 15 states have internal predecessors, (59), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:31:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2025-01-10 02:31:55,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 02:31:55,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:55,209 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:55,215 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:31:55,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:55,410 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:31:55,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:55,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1796117801, now seen corresponding path program 1 times [2025-01-10 02:31:55,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:55,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625186161] [2025-01-10 02:31:55,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:55,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:55,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 02:31:55,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 02:31:55,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:55,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 02:31:55,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:55,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625186161] [2025-01-10 02:31:55,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625186161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:55,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:31:55,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:31:55,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282400531] [2025-01-10 02:31:55,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:55,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:31:55,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:55,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:31:55,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:31:55,503 INFO L87 Difference]: Start difference. First operand 106 states and 139 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:31:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:55,530 INFO L93 Difference]: Finished difference Result 138 states and 189 transitions. [2025-01-10 02:31:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:31:55,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-01-10 02:31:55,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:55,532 INFO L225 Difference]: With dead ends: 138 [2025-01-10 02:31:55,532 INFO L226 Difference]: Without dead ends: 136 [2025-01-10 02:31:55,533 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:31:55,534 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:55,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 114 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:31:55,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-10 02:31:55,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2025-01-10 02:31:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 98 states have internal predecessors, (108), 17 states have call successors, (17), 5 states have call predecessors, (17), 8 states have return successors, (40), 20 states have call predecessors, (40), 16 states have call successors, (40) [2025-01-10 02:31:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 165 transitions. [2025-01-10 02:31:55,553 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 165 transitions. Word has length 31 [2025-01-10 02:31:55,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:55,553 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 165 transitions. [2025-01-10 02:31:55,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:31:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 165 transitions. [2025-01-10 02:31:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 02:31:55,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:55,557 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:55,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:31:55,557 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:31:55,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:55,558 INFO L85 PathProgramCache]: Analyzing trace with hash 516283740, now seen corresponding path program 1 times [2025-01-10 02:31:55,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:55,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461477416] [2025-01-10 02:31:55,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:55,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:55,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 02:31:55,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:31:55,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:55,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 02:31:55,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:55,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461477416] [2025-01-10 02:31:55,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461477416] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:55,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86067336] [2025-01-10 02:31:55,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:55,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:55,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:55,655 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:31:55,656 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:31:55,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 02:31:55,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:31:55,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:55,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:55,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 02:31:55,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:31:55,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:31:56,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86067336] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:56,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:56,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 16 [2025-01-10 02:31:56,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501276097] [2025-01-10 02:31:56,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:56,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 02:31:56,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:56,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 02:31:56,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:31:56,075 INFO L87 Difference]: Start difference. First operand 124 states and 165 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 13 states have internal predecessors, (53), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:31:56,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:56,456 INFO L93 Difference]: Finished difference Result 263 states and 352 transitions. [2025-01-10 02:31:56,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 02:31:56,458 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 13 states have internal predecessors, (53), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2025-01-10 02:31:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:56,459 INFO L225 Difference]: With dead ends: 263 [2025-01-10 02:31:56,459 INFO L226 Difference]: Without dead ends: 154 [2025-01-10 02:31:56,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-01-10 02:31:56,460 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 85 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:56,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 559 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:31:56,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-10 02:31:56,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 139. [2025-01-10 02:31:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 110 states have internal predecessors, (122), 19 states have call successors, (19), 6 states have call predecessors, (19), 9 states have return successors, (45), 22 states have call predecessors, (45), 18 states have call successors, (45) [2025-01-10 02:31:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 186 transitions. [2025-01-10 02:31:56,483 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 186 transitions. Word has length 36 [2025-01-10 02:31:56,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:56,483 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 186 transitions. [2025-01-10 02:31:56,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 13 states have internal predecessors, (53), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:31:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 186 transitions. [2025-01-10 02:31:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 02:31:56,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:56,486 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:56,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 02:31:56,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:56,687 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:31:56,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:56,688 INFO L85 PathProgramCache]: Analyzing trace with hash 311039018, now seen corresponding path program 2 times [2025-01-10 02:31:56,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:56,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967430160] [2025-01-10 02:31:56,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:31:56,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:56,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 02:31:56,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:31:56,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:31:56,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 02:31:56,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:56,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967430160] [2025-01-10 02:31:56,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967430160] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:56,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188476453] [2025-01-10 02:31:56,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:31:56,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:56,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:56,753 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:31:56,754 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:31:56,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 02:31:56,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:31:56,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:31:56,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:56,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:31:56,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 02:31:56,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:31:56,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188476453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:56,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:31:56,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-10 02:31:56,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078392680] [2025-01-10 02:31:56,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:56,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:31:56,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:56,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:31:56,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:31:56,828 INFO L87 Difference]: Start difference. First operand 139 states and 186 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:31:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:56,853 INFO L93 Difference]: Finished difference Result 146 states and 196 transitions. [2025-01-10 02:31:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:31:56,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-01-10 02:31:56,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:56,855 INFO L225 Difference]: With dead ends: 146 [2025-01-10 02:31:56,855 INFO L226 Difference]: Without dead ends: 145 [2025-01-10 02:31:56,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:31:56,855 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:56,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 107 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:31:56,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-10 02:31:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2025-01-10 02:31:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 111 states have (on average 1.135135135135135) internal successors, (126), 112 states have internal predecessors, (126), 19 states have call successors, (19), 6 states have call predecessors, (19), 9 states have return successors, (45), 24 states have call predecessors, (45), 18 states have call successors, (45) [2025-01-10 02:31:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 190 transitions. [2025-01-10 02:31:56,880 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 190 transitions. Word has length 36 [2025-01-10 02:31:56,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:56,880 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 190 transitions. [2025-01-10 02:31:56,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:31:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 190 transitions. [2025-01-10 02:31:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 02:31:56,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:56,886 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:56,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 02:31:57,086 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,SelfDestructingSolverStorable11 [2025-01-10 02:31:57,086 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:31:57,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:57,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1052275065, now seen corresponding path program 1 times [2025-01-10 02:31:57,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:57,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360194922] [2025-01-10 02:31:57,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:57,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:57,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 02:31:57,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 02:31:57,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:57,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 02:31:57,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:57,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360194922] [2025-01-10 02:31:57,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360194922] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:57,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401154914] [2025-01-10 02:31:57,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:57,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:57,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:57,150 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:31:57,151 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:31:57,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 02:31:57,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 02:31:57,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:57,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:57,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:31:57,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 02:31:57,224 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:31:57,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401154914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:57,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:31:57,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-01-10 02:31:57,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487444564] [2025-01-10 02:31:57,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:57,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:31:57,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:57,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:31:57,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:31:57,225 INFO L87 Difference]: Start difference. First operand 143 states and 190 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:31:57,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:57,258 INFO L93 Difference]: Finished difference Result 159 states and 211 transitions. [2025-01-10 02:31:57,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:31:57,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2025-01-10 02:31:57,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:57,259 INFO L225 Difference]: With dead ends: 159 [2025-01-10 02:31:57,259 INFO L226 Difference]: Without dead ends: 158 [2025-01-10 02:31:57,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:31:57,262 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:57,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 184 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:31:57,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-01-10 02:31:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 139. [2025-01-10 02:31:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 109 states have internal predecessors, (123), 18 states have call successors, (18), 6 states have call predecessors, (18), 9 states have return successors, (42), 23 states have call predecessors, (42), 17 states have call successors, (42) [2025-01-10 02:31:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 183 transitions. [2025-01-10 02:31:57,277 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 183 transitions. Word has length 37 [2025-01-10 02:31:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:57,278 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 183 transitions. [2025-01-10 02:31:57,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:31:57,278 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 183 transitions. [2025-01-10 02:31:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 02:31:57,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:57,279 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:57,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 02:31:57,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 02:31:57,480 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:31:57,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:57,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1843083636, now seen corresponding path program 1 times [2025-01-10 02:31:57,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:57,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356899129] [2025-01-10 02:31:57,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:57,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:57,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 02:31:57,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 02:31:57,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:57,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:57,555 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-10 02:31:57,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:57,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356899129] [2025-01-10 02:31:57,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356899129] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:57,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356506047] [2025-01-10 02:31:57,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:57,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:57,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:57,562 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:31:57,563 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:31:57,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 02:31:57,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 02:31:57,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:57,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:57,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 02:31:57,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:31:57,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:31:58,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356506047] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:58,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:58,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 15 [2025-01-10 02:31:58,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87332165] [2025-01-10 02:31:58,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:58,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 02:31:58,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:58,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 02:31:58,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:31:58,073 INFO L87 Difference]: Start difference. First operand 139 states and 183 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 02:31:58,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:58,400 INFO L93 Difference]: Finished difference Result 269 states and 368 transitions. [2025-01-10 02:31:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 02:31:58,403 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 51 [2025-01-10 02:31:58,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:58,404 INFO L225 Difference]: With dead ends: 269 [2025-01-10 02:31:58,404 INFO L226 Difference]: Without dead ends: 155 [2025-01-10 02:31:58,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 86 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2025-01-10 02:31:58,405 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 79 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:58,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 223 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:31:58,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-10 02:31:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2025-01-10 02:31:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 104 states have (on average 1.125) internal successors, (117), 107 states have internal predecessors, (117), 17 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (31), 20 states have call predecessors, (31), 16 states have call successors, (31) [2025-01-10 02:31:58,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 165 transitions. [2025-01-10 02:31:58,433 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 165 transitions. Word has length 51 [2025-01-10 02:31:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:58,433 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 165 transitions. [2025-01-10 02:31:58,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 02:31:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 165 transitions. [2025-01-10 02:31:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 02:31:58,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:58,434 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:58,442 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:31:58,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 02:31:58,635 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:31:58,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2124162897, now seen corresponding path program 1 times [2025-01-10 02:31:58,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:58,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901575843] [2025-01-10 02:31:58,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:58,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 02:31:58,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 02:31:58,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:58,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 02:31:58,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:58,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901575843] [2025-01-10 02:31:58,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901575843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:58,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:31:58,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:31:58,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184294506] [2025-01-10 02:31:58,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:58,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:31:58,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:58,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:31:58,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:31:58,722 INFO L87 Difference]: Start difference. First operand 135 states and 165 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:31:58,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:58,745 INFO L93 Difference]: Finished difference Result 152 states and 187 transitions. [2025-01-10 02:31:58,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:31:58,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2025-01-10 02:31:58,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:58,747 INFO L225 Difference]: With dead ends: 152 [2025-01-10 02:31:58,748 INFO L226 Difference]: Without dead ends: 151 [2025-01-10 02:31:58,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:31:58,748 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:58,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 117 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:31:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-10 02:31:58,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 141. [2025-01-10 02:31:58,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 110 states have (on average 1.1181818181818182) internal successors, (123), 110 states have internal predecessors, (123), 17 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (31), 23 states have call predecessors, (31), 16 states have call successors, (31) [2025-01-10 02:31:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 171 transitions. [2025-01-10 02:31:58,757 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 171 transitions. Word has length 50 [2025-01-10 02:31:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:58,758 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 171 transitions. [2025-01-10 02:31:58,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:31:58,758 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 171 transitions. [2025-01-10 02:31:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 02:31:58,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:58,759 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:58,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 02:31:58,759 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibo2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:31:58,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:58,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1424540440, now seen corresponding path program 1 times [2025-01-10 02:31:58,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:58,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033139767] [2025-01-10 02:31:58,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:58,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:58,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 02:31:58,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 02:31:58,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:58,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 02:31:58,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:58,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033139767] [2025-01-10 02:31:58,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033139767] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:58,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401680915] [2025-01-10 02:31:58,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:58,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:58,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:58,878 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:31:58,885 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:31:58,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 02:31:58,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 02:31:58,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:58,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:58,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:31:58,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 02:31:58,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:31:58,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401680915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:31:58,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:31:58,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2025-01-10 02:31:58,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381933310] [2025-01-10 02:31:58,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:31:58,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:31:58,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:58,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:31:58,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:31:58,988 INFO L87 Difference]: Start difference. First operand 141 states and 171 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:31:59,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:59,037 INFO L93 Difference]: Finished difference Result 182 states and 240 transitions. [2025-01-10 02:31:59,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:31:59,037 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 51 [2025-01-10 02:31:59,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:59,038 INFO L225 Difference]: With dead ends: 182 [2025-01-10 02:31:59,038 INFO L226 Difference]: Without dead ends: 181 [2025-01-10 02:31:59,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:31:59,039 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:59,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 202 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:31:59,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-10 02:31:59,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 166. [2025-01-10 02:31:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 130 states have (on average 1.123076923076923) internal successors, (146), 128 states have internal predecessors, (146), 20 states have call successors, (20), 7 states have call predecessors, (20), 12 states have return successors, (50), 30 states have call predecessors, (50), 19 states have call successors, (50) [2025-01-10 02:31:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 216 transitions. [2025-01-10 02:31:59,049 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 216 transitions. Word has length 51 [2025-01-10 02:31:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:31:59,050 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 216 transitions. [2025-01-10 02:31:59,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:31:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 216 transitions. [2025-01-10 02:31:59,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 02:31:59,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:31:59,051 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:31:59,061 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:31:59,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:59,255 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:31:59,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:31:59,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1919929995, now seen corresponding path program 1 times [2025-01-10 02:31:59,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:31:59,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372401562] [2025-01-10 02:31:59,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:59,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:31:59,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 02:31:59,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 02:31:59,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:59,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-10 02:31:59,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:31:59,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372401562] [2025-01-10 02:31:59,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372401562] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:31:59,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804443644] [2025-01-10 02:31:59,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:31:59,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:31:59,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:31:59,311 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:31:59,312 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:31:59,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 02:31:59,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 02:31:59,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:31:59,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:31:59,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 02:31:59,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:31:59,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:31:59,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804443644] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:59,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:59,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 13] total 26 [2025-01-10 02:31:59,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206585447] [2025-01-10 02:31:59,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:59,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 02:31:59,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:59,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 02:31:59,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2025-01-10 02:31:59,636 INFO L87 Difference]: Start difference. First operand 166 states and 216 transitions. Second operand has 26 states, 24 states have (on average 3.875) internal successors, (93), 18 states have internal predecessors, (93), 13 states have call successors, (19), 9 states have call predecessors, (19), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-10 02:31:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:31:59,990 INFO L93 Difference]: Finished difference Result 279 states and 369 transitions. [2025-01-10 02:31:59,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 02:31:59,990 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.875) internal successors, (93), 18 states have internal predecessors, (93), 13 states have call successors, (19), 9 states have call predecessors, (19), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 60 [2025-01-10 02:31:59,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:31:59,991 INFO L225 Difference]: With dead ends: 279 [2025-01-10 02:31:59,991 INFO L226 Difference]: Without dead ends: 152 [2025-01-10 02:31:59,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=1135, Unknown=0, NotChecked=0, Total=1332 [2025-01-10 02:31:59,993 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 164 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:31:59,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 373 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:31:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-10 02:32:00,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2025-01-10 02:32:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 115 states have (on average 1.1130434782608696) internal successors, (128), 117 states have internal predecessors, (128), 18 states have call successors, (18), 7 states have call predecessors, (18), 12 states have return successors, (27), 24 states have call predecessors, (27), 17 states have call successors, (27) [2025-01-10 02:32:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2025-01-10 02:32:00,003 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 60 [2025-01-10 02:32:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:00,003 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2025-01-10 02:32:00,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.875) internal successors, (93), 18 states have internal predecessors, (93), 13 states have call successors, (19), 9 states have call predecessors, (19), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-10 02:32:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2025-01-10 02:32:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 02:32:00,004 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:00,004 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:32:00,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 02:32:00,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 02:32:00,205 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:32:00,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:00,205 INFO L85 PathProgramCache]: Analyzing trace with hash -814175986, now seen corresponding path program 1 times [2025-01-10 02:32:00,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:00,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563701318] [2025-01-10 02:32:00,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:00,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:00,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 02:32:00,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 02:32:00,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:00,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-10 02:32:00,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:00,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563701318] [2025-01-10 02:32:00,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563701318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:32:00,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:32:00,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:32:00,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015013028] [2025-01-10 02:32:00,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:32:00,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:32:00,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:00,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:32:00,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:32:00,246 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:32:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:00,266 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2025-01-10 02:32:00,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:32:00,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2025-01-10 02:32:00,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:00,267 INFO L225 Difference]: With dead ends: 151 [2025-01-10 02:32:00,267 INFO L226 Difference]: Without dead ends: 150 [2025-01-10 02:32:00,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:32:00,267 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:32:00,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 111 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:32:00,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-10 02:32:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2025-01-10 02:32:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 115 states have (on average 1.0956521739130434) internal successors, (126), 117 states have internal predecessors, (126), 18 states have call successors, (18), 7 states have call predecessors, (18), 12 states have return successors, (27), 24 states have call predecessors, (27), 17 states have call successors, (27) [2025-01-10 02:32:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2025-01-10 02:32:00,277 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 55 [2025-01-10 02:32:00,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:00,277 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2025-01-10 02:32:00,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:32:00,277 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2025-01-10 02:32:00,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 02:32:00,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:00,278 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:32:00,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 02:32:00,278 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:32:00,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:00,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1958736820, now seen corresponding path program 1 times [2025-01-10 02:32:00,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:00,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458582296] [2025-01-10 02:32:00,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:00,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:00,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 02:32:00,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 02:32:00,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:00,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 02:32:00,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:00,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458582296] [2025-01-10 02:32:00,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458582296] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:32:00,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759168184] [2025-01-10 02:32:00,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:00,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:00,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:00,434 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:32:00,440 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:32:00,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 02:32:00,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 02:32:00,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:00,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:00,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:32:00,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:32:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-10 02:32:00,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:32:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-10 02:32:00,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759168184] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:32:00,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:32:00,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 23 [2025-01-10 02:32:00,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126727786] [2025-01-10 02:32:00,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:32:00,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 02:32:00,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:00,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 02:32:00,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2025-01-10 02:32:00,731 INFO L87 Difference]: Start difference. First operand 149 states and 171 transitions. Second operand has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 21 states have internal predecessors, (79), 9 states have call successors, (14), 3 states have call predecessors, (14), 6 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) [2025-01-10 02:32:01,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:01,178 INFO L93 Difference]: Finished difference Result 259 states and 296 transitions. [2025-01-10 02:32:01,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 02:32:01,179 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 21 states have internal predecessors, (79), 9 states have call successors, (14), 3 states have call predecessors, (14), 6 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) Word has length 68 [2025-01-10 02:32:01,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:01,180 INFO L225 Difference]: With dead ends: 259 [2025-01-10 02:32:01,180 INFO L226 Difference]: Without dead ends: 161 [2025-01-10 02:32:01,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=1490, Unknown=0, NotChecked=0, Total=1722 [2025-01-10 02:32:01,181 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 105 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:32:01,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 229 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:32:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-10 02:32:01,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 139. [2025-01-10 02:32:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 106 states have (on average 1.0754716981132075) internal successors, (114), 111 states have internal predecessors, (114), 17 states have call successors, (17), 7 states have call predecessors, (17), 12 states have return successors, (22), 20 states have call predecessors, (22), 16 states have call successors, (22) [2025-01-10 02:32:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2025-01-10 02:32:01,188 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 68 [2025-01-10 02:32:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:01,188 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2025-01-10 02:32:01,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 21 states have internal predecessors, (79), 9 states have call successors, (14), 3 states have call predecessors, (14), 6 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) [2025-01-10 02:32:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2025-01-10 02:32:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-10 02:32:01,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:01,189 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:32:01,195 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:32:01,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:01,389 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fibo2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:32:01,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:01,390 INFO L85 PathProgramCache]: Analyzing trace with hash 103911917, now seen corresponding path program 1 times [2025-01-10 02:32:01,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:01,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138619270] [2025-01-10 02:32:01,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:01,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:01,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 02:32:01,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 02:32:01,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:01,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 02:32:01,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:01,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138619270] [2025-01-10 02:32:01,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138619270] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:32:01,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271505719] [2025-01-10 02:32:01,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:01,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:01,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:01,544 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:32:01,544 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:32:01,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 02:32:01,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 02:32:01,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:01,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:01,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 02:32:01,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:32:01,732 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-10 02:32:01,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:32:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-10 02:32:02,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271505719] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:32:02,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:32:02,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 11] total 28 [2025-01-10 02:32:02,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695460466] [2025-01-10 02:32:02,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:32:02,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 02:32:02,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:02,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 02:32:02,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2025-01-10 02:32:02,104 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand has 28 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 states have internal predecessors, (97), 12 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 14 states have call predecessors, (16), 10 states have call successors, (16) [2025-01-10 02:32:02,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:02,750 INFO L93 Difference]: Finished difference Result 234 states and 257 transitions. [2025-01-10 02:32:02,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-10 02:32:02,750 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 states have internal predecessors, (97), 12 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 14 states have call predecessors, (16), 10 states have call successors, (16) Word has length 69 [2025-01-10 02:32:02,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:02,751 INFO L225 Difference]: With dead ends: 234 [2025-01-10 02:32:02,751 INFO L226 Difference]: Without dead ends: 111 [2025-01-10 02:32:02,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=2417, Unknown=0, NotChecked=0, Total=2756 [2025-01-10 02:32:02,752 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 101 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:32:02,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 282 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:32:02,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-10 02:32:02,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2025-01-10 02:32:02,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.056338028169014) internal successors, (75), 75 states have internal predecessors, (75), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-10 02:32:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2025-01-10 02:32:02,763 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 69 [2025-01-10 02:32:02,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:02,763 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2025-01-10 02:32:02,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 states have internal predecessors, (97), 12 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 14 states have call predecessors, (16), 10 states have call successors, (16) [2025-01-10 02:32:02,766 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2025-01-10 02:32:02,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-10 02:32:02,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:02,767 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:32:02,773 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:32:02,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:02,968 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:32:02,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:02,968 INFO L85 PathProgramCache]: Analyzing trace with hash 397031206, now seen corresponding path program 1 times [2025-01-10 02:32:02,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:02,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657868531] [2025-01-10 02:32:02,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:02,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:02,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-10 02:32:02,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-10 02:32:02,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:02,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-01-10 02:32:03,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657868531] [2025-01-10 02:32:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657868531] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:32:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901910799] [2025-01-10 02:32:03,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:03,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:03,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:03,256 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:32:03,260 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:32:03,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-10 02:32:03,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-10 02:32:03,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:03,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:03,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 02:32:03,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:32:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-10 02:32:03,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:32:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-01-10 02:32:03,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901910799] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:32:03,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:32:03,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 15] total 33 [2025-01-10 02:32:03,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049595434] [2025-01-10 02:32:03,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:32:03,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-10 02:32:03,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:03,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-10 02:32:03,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2025-01-10 02:32:03,856 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 9 states have call successors, (11), 1 states have call predecessors, (11), 13 states have return successors, (19), 18 states have call predecessors, (19), 9 states have call successors, (19) [2025-01-10 02:32:04,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:04,036 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2025-01-10 02:32:04,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 02:32:04,036 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 9 states have call successors, (11), 1 states have call predecessors, (11), 13 states have return successors, (19), 18 states have call predecessors, (19), 9 states have call successors, (19) Word has length 83 [2025-01-10 02:32:04,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:04,037 INFO L225 Difference]: With dead ends: 114 [2025-01-10 02:32:04,037 INFO L226 Difference]: Without dead ends: 113 [2025-01-10 02:32:04,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=1221, Unknown=0, NotChecked=0, Total=1406 [2025-01-10 02:32:04,038 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:32:04,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 611 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:32:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-10 02:32:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2025-01-10 02:32:04,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 74 states have internal predecessors, (74), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-10 02:32:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2025-01-10 02:32:04,043 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 83 [2025-01-10 02:32:04,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:04,043 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2025-01-10 02:32:04,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 9 states have call successors, (11), 1 states have call predecessors, (11), 13 states have return successors, (19), 18 states have call predecessors, (19), 9 states have call successors, (19) [2025-01-10 02:32:04,043 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2025-01-10 02:32:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 02:32:04,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:04,044 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:32:04,050 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:32:04,244 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,SelfDestructingSolverStorable20 [2025-01-10 02:32:04,244 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 02:32:04,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:04,245 INFO L85 PathProgramCache]: Analyzing trace with hash -576934403, now seen corresponding path program 1 times [2025-01-10 02:32:04,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:04,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133992980] [2025-01-10 02:32:04,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:04,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:04,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 02:32:04,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 02:32:04,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:04,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:04,481 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-01-10 02:32:04,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:04,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133992980] [2025-01-10 02:32:04,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133992980] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:32:04,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742909461] [2025-01-10 02:32:04,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:04,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:04,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:04,485 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:32:04,485 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:32:04,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 02:32:04,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 02:32:04,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:04,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:04,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 02:32:04,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:32:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-10 02:32:04,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:32:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-01-10 02:32:05,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742909461] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:32:05,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:32:05,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 16] total 33 [2025-01-10 02:32:05,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890778396] [2025-01-10 02:32:05,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:32:05,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-10 02:32:05,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:05,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-10 02:32:05,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2025-01-10 02:32:05,019 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 34 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 34 states have internal predecessors, (93), 9 states have call successors, (11), 1 states have call predecessors, (11), 12 states have return successors, (20), 20 states have call predecessors, (20), 9 states have call successors, (20) [2025-01-10 02:32:05,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:05,113 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2025-01-10 02:32:05,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 02:32:05,114 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 34 states have internal predecessors, (93), 9 states have call successors, (11), 1 states have call predecessors, (11), 12 states have return successors, (20), 20 states have call predecessors, (20), 9 states have call successors, (20) Word has length 84 [2025-01-10 02:32:05,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:05,114 INFO L225 Difference]: With dead ends: 110 [2025-01-10 02:32:05,114 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:32:05,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 145 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 02:32:05,120 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:32:05,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 588 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:32:05,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:32:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:32:05,120 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:32:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:32:05,121 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2025-01-10 02:32:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:05,121 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:32:05,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 34 states have internal predecessors, (93), 9 states have call successors, (11), 1 states have call predecessors, (11), 12 states have return successors, (20), 20 states have call predecessors, (20), 9 states have call successors, (20) [2025-01-10 02:32:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:32:05,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:32:05,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-01-10 02:32:05,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-01-10 02:32:05,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-01-10 02:32:05,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-01-10 02:32:05,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-01-10 02:32:05,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-01-10 02:32:05,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-01-10 02:32:05,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-01-10 02:32:05,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-01-10 02:32:05,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-01-10 02:32:05,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-01-10 02:32:05,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-01-10 02:32:05,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 02:32:05,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:05,330 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:32:05,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:32:06,213 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:32:06,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:32:06 BoogieIcfgContainer [2025-01-10 02:32:06,217 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:32:06,221 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:32:06,222 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:32:06,222 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:32:06,222 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:31:53" (3/4) ... [2025-01-10 02:32:06,224 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 02:32:06,232 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2025-01-10 02:32:06,236 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2025-01-10 02:32:06,239 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-10 02:32:06,240 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 02:32:06,240 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 02:32:06,240 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 02:32:06,296 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:32:06,297 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:32:06,297 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:32:06,298 INFO L158 Benchmark]: Toolchain (without parser) took 13892.54ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 112.3MB in the beginning and 287.0MB in the end (delta: -174.6MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2025-01-10 02:32:06,298 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:32:06,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.73ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 101.3MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:32:06,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.64ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 100.5MB in the end (delta: 881.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:32:06,299 INFO L158 Benchmark]: Boogie Preprocessor took 40.55ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:32:06,299 INFO L158 Benchmark]: RCFGBuilder took 334.23ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 87.4MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 02:32:06,299 INFO L158 Benchmark]: TraceAbstraction took 13162.20ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 86.5MB in the beginning and 291.0MB in the end (delta: -204.5MB). Peak memory consumption was 178.2MB. Max. memory is 16.1GB. [2025-01-10 02:32:06,299 INFO L158 Benchmark]: Witness Printer took 75.34ms. Allocated memory is still 360.7MB. Free memory was 291.0MB in the beginning and 287.0MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:32:06,300 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.20ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.73ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 101.3MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.64ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 100.5MB in the end (delta: 881.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.55ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 334.23ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 87.4MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13162.20ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 86.5MB in the beginning and 291.0MB in the end (delta: -204.5MB). Peak memory consumption was 178.2MB. Max. memory is 16.1GB. * Witness Printer took 75.34ms. Allocated memory is still 360.7MB. Free memory was 291.0MB in the beginning and 287.0MB in the end (delta: 4.1MB). 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: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: 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 3 procedures, 53 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 22, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 867 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 839 mSDsluCounter, 5103 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4316 mSDsCounter, 241 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4447 IncrementalHoareTripleChecker+Invalid, 4688 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 241 mSolverCounterUnsat, 787 mSDtfsCounter, 4447 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1341 GetRequests, 982 SyntacticMatches, 35 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=16, InterpolantAutomatonStates: 232, 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, 22 MinimizatonAttempts, 202 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1513 NumberOfCodeBlocks, 1513 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1952 ConstructedInterpolants, 0 QuantifiedInterpolants, 4358 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1402 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 42 InterpolantComputations, 14 PerfectInterpolantSequences, 1023/1353 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 02:32:06,321 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