./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-2.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-2.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 22d9a6832a4080412e38f5d573b63985f3b10b3c2009b6559595c7c0bbda414f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:31:58,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:31:58,313 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:58,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:31:58,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:31:58,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:31:58,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:31:58,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:31:58,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:31:58,346 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:31:58,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:31:58,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:31:58,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:31:58,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:31:58,348 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:31:58,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:31:58,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:31:58,348 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:31:58,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:31:58,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:31:58,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:31:58,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:31:58,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:31:58,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:31:58,349 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:31:58,349 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:31:58,349 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:31:58,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:31:58,349 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:31:58,349 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:31:58,349 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:31:58,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:31:58,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:31:58,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:31:58,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:31:58,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:31:58,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:31:58,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:31:58,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:31:58,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:31:58,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:31:58,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:31:58,350 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:31:58,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:31:58,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:31:58,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:31:58,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:31:58,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:31:58,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:31:58,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:31:58,351 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 -> 22d9a6832a4080412e38f5d573b63985f3b10b3c2009b6559595c7c0bbda414f [2025-01-10 02:31:58,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:31:58,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:31:58,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:31:58,600 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:31:58,601 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:31:58,602 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-2.c [2025-01-10 02:31:59,899 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f619f38d/e4814c524af74f02b5f0159fc3f33db6/FLAGadf70b3fa [2025-01-10 02:32:00,169 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:32:00,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_4-2.c [2025-01-10 02:32:00,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f619f38d/e4814c524af74f02b5f0159fc3f33db6/FLAGadf70b3fa [2025-01-10 02:32:00,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f619f38d/e4814c524af74f02b5f0159fc3f33db6 [2025-01-10 02:32:00,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:32:00,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:32:00,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:32:00,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:32:00,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:32:00,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:32:00" (1/1) ... [2025-01-10 02:32:00,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54cf1a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:32:00, skipping insertion in model container [2025-01-10 02:32:00,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:32:00" (1/1) ... [2025-01-10 02:32:00,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:32:00,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:32:00,362 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:32:00,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:32:00,394 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:32:00,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:32:00 WrapperNode [2025-01-10 02:32:00,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:32:00,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:32:00,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:32:00,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:32:00,404 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:32:00" (1/1) ... [2025-01-10 02:32:00,410 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:32:00" (1/1) ... [2025-01-10 02:32:00,423 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2025-01-10 02:32:00,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:32:00,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:32:00,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:32:00,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:32:00,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:32:00" (1/1) ... [2025-01-10 02:32:00,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:32:00" (1/1) ... [2025-01-10 02:32:00,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:32:00" (1/1) ... [2025-01-10 02:32:00,450 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:32:00,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:32:00" (1/1) ... [2025-01-10 02:32:00,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:32:00" (1/1) ... [2025-01-10 02:32:00,455 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:32:00" (1/1) ... [2025-01-10 02:32:00,456 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:32:00" (1/1) ... [2025-01-10 02:32:00,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:32:00" (1/1) ... [2025-01-10 02:32:00,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:32:00" (1/1) ... [2025-01-10 02:32:00,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:32:00" (1/1) ... [2025-01-10 02:32:00,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:32:00,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:32:00,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:32:00,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:32:00,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:32:00" (1/1) ... [2025-01-10 02:32:00,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:32:00,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:00,499 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:32:00,506 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:32:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:32:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:32:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2025-01-10 02:32:00,528 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2025-01-10 02:32:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2025-01-10 02:32:00,528 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2025-01-10 02:32:00,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:32:00,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:32:00,578 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:32:00,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:32:00,757 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-10 02:32:00,757 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:32:00,778 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:32:00,779 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 02:32:00,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:32:00 BoogieIcfgContainer [2025-01-10 02:32:00,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:32:00,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:32:00,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:32:00,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:32:00,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:32:00" (1/3) ... [2025-01-10 02:32:00,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1593811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:32:00, skipping insertion in model container [2025-01-10 02:32:00,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:32:00" (2/3) ... [2025-01-10 02:32:00,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1593811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:32:00, skipping insertion in model container [2025-01-10 02:32:00,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:32:00" (3/3) ... [2025-01-10 02:32:00,790 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-2.c [2025-01-10 02:32:00,807 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:32:00,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_2calls_4-2.c that has 3 procedures, 53 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-01-10 02:32:00,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:32:00,872 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;@6d830d36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:32:00,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-10 02:32:00,876 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:32:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 02:32:00,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:00,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:32:00,882 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:32:00,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1867028009, now seen corresponding path program 1 times [2025-01-10 02:32:00,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:00,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003621892] [2025-01-10 02:32:00,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:00,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:00,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 02:32:00,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 02:32:00,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:00,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:01,017 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:32:01,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:01,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003621892] [2025-01-10 02:32:01,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003621892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:32:01,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:32:01,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:32:01,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040500473] [2025-01-10 02:32:01,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:32:01,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:32:01,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:01,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:32:01,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:32:01,038 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:32:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:01,081 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-01-10 02:32:01,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:32:01,083 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:32:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:01,087 INFO L225 Difference]: With dead ends: 59 [2025-01-10 02:32:01,088 INFO L226 Difference]: Without dead ends: 45 [2025-01-10 02:32:01,090 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:32:01,092 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:32:01,093 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:32:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-10 02:32:01,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-01-10 02:32:01,122 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:32:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-01-10 02:32:01,128 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 7 [2025-01-10 02:32:01,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:01,128 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-01-10 02:32:01,128 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:32:01,128 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-01-10 02:32:01,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 02:32:01,129 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:01,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:32:01,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:32:01,130 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:32:01,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:01,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2043293518, now seen corresponding path program 1 times [2025-01-10 02:32:01,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:01,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571616704] [2025-01-10 02:32:01,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:01,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:01,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:32:01,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:32:01,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:01,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:01,224 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:32:01,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:01,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571616704] [2025-01-10 02:32:01,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571616704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:32:01,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:32:01,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:32:01,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505066267] [2025-01-10 02:32:01,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:32:01,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:32:01,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:01,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:32:01,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:32:01,227 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:32:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:01,307 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2025-01-10 02:32:01,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:32:01,309 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:32:01,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:01,311 INFO L225 Difference]: With dead ends: 64 [2025-01-10 02:32:01,311 INFO L226 Difference]: Without dead ends: 58 [2025-01-10 02:32:01,311 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:32:01,312 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.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:32:01,312 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.1s Time] [2025-01-10 02:32:01,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-10 02:32:01,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-01-10 02:32:01,319 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:32:01,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2025-01-10 02:32:01,321 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 8 [2025-01-10 02:32:01,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:01,321 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2025-01-10 02:32:01,322 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:32:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2025-01-10 02:32:01,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 02:32:01,323 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:01,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:32:01,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:32:01,323 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:32:01,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:01,324 INFO L85 PathProgramCache]: Analyzing trace with hash -749725533, now seen corresponding path program 1 times [2025-01-10 02:32:01,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:01,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843457351] [2025-01-10 02:32:01,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:01,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:01,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 02:32:01,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 02:32:01,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:01,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:01,370 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:32:01,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:01,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843457351] [2025-01-10 02:32:01,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843457351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:32:01,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:32:01,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:32:01,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954725162] [2025-01-10 02:32:01,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:32:01,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:32:01,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:01,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:32:01,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:32:01,372 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:32:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:01,407 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2025-01-10 02:32:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:32:01,408 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:32:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:01,409 INFO L225 Difference]: With dead ends: 58 [2025-01-10 02:32:01,409 INFO L226 Difference]: Without dead ends: 56 [2025-01-10 02:32:01,409 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:32:01,410 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:32:01,410 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:32:01,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-10 02:32:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-01-10 02:32:01,417 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:32:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-01-10 02:32:01,418 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 13 [2025-01-10 02:32:01,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:01,418 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-01-10 02:32:01,419 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:32:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-01-10 02:32:01,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 02:32:01,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:01,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:32:01,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:32:01,420 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:32:01,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:01,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1766654982, now seen corresponding path program 1 times [2025-01-10 02:32:01,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:01,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092023527] [2025-01-10 02:32:01,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:01,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:01,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:32:01,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:32:01,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:01,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:01,526 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:32:01,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:01,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092023527] [2025-01-10 02:32:01,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092023527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:32:01,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:32:01,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:32:01,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044225381] [2025-01-10 02:32:01,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:32:01,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:32:01,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:01,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:32:01,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:32:01,528 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:32:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:01,656 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2025-01-10 02:32:01,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:32:01,656 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:32:01,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:01,657 INFO L225 Difference]: With dead ends: 58 [2025-01-10 02:32:01,657 INFO L226 Difference]: Without dead ends: 54 [2025-01-10 02:32:01,657 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:32:01,658 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:32:01,658 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:32:01,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-10 02:32:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2025-01-10 02:32:01,665 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:32:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-01-10 02:32:01,666 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 14 [2025-01-10 02:32:01,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:01,666 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-01-10 02:32:01,666 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:32:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-01-10 02:32:01,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 02:32:01,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:01,667 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:32:01,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:32:01,667 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:32:01,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:01,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2097999453, now seen corresponding path program 1 times [2025-01-10 02:32:01,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:01,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527143932] [2025-01-10 02:32:01,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:01,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:01,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 02:32:01,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 02:32:01,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:01,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:01,799 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:32:01,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:01,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527143932] [2025-01-10 02:32:01,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527143932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:32:01,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:32:01,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:32:01,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81221518] [2025-01-10 02:32:01,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:32:01,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:32:01,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:01,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:32:01,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:32:01,801 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:32:01,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:01,850 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2025-01-10 02:32:01,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:32:01,851 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:32:01,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:01,852 INFO L225 Difference]: With dead ends: 74 [2025-01-10 02:32:01,852 INFO L226 Difference]: Without dead ends: 69 [2025-01-10 02:32:01,853 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:32:01,853 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:32:01,853 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:32:01,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-10 02:32:01,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-01-10 02:32:01,866 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:32:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2025-01-10 02:32:01,868 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 23 [2025-01-10 02:32:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:01,868 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2025-01-10 02:32:01,868 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:32:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2025-01-10 02:32:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 02:32:01,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:01,869 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:32:01,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:32:01,869 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:32:01,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:01,870 INFO L85 PathProgramCache]: Analyzing trace with hash 624421350, now seen corresponding path program 1 times [2025-01-10 02:32:01,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:01,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28423932] [2025-01-10 02:32:01,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:01,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:01,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:32:01,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:32:01,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:01,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:02,007 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:32:02,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:02,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28423932] [2025-01-10 02:32:02,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28423932] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:32:02,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458930724] [2025-01-10 02:32:02,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:02,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:02,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:02,012 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:32:02,013 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:32:02,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:32:02,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:32:02,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:02,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:02,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:32:02,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:32:02,158 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:32:02,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:32:02,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458930724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:32:02,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:32:02,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2025-01-10 02:32:02,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301574867] [2025-01-10 02:32:02,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:32:02,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:32:02,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:02,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:32:02,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:32:02,160 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:32:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:02,276 INFO L93 Difference]: Finished difference Result 113 states and 140 transitions. [2025-01-10 02:32:02,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:32:02,277 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:32:02,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:02,278 INFO L225 Difference]: With dead ends: 113 [2025-01-10 02:32:02,278 INFO L226 Difference]: Without dead ends: 63 [2025-01-10 02:32:02,279 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:32:02,280 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:32:02,281 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:32:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-10 02:32:02,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2025-01-10 02:32:02,288 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:32:02,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2025-01-10 02:32:02,290 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 24 [2025-01-10 02:32:02,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:02,291 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2025-01-10 02:32:02,291 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:32:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2025-01-10 02:32:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 02:32:02,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:02,292 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:32:02,298 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:32:02,493 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:32:02,493 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:32:02,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:02,493 INFO L85 PathProgramCache]: Analyzing trace with hash 120521327, now seen corresponding path program 1 times [2025-01-10 02:32:02,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:02,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819784713] [2025-01-10 02:32:02,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:02,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:02,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:32:02,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:32:02,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:02,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:02,575 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:32:02,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:02,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819784713] [2025-01-10 02:32:02,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819784713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:32:02,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:32:02,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:32:02,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141703288] [2025-01-10 02:32:02,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:32:02,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:32:02,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:02,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:32:02,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:32:02,577 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:32:02,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:02,625 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2025-01-10 02:32:02,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:32:02,625 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:32:02,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:02,626 INFO L225 Difference]: With dead ends: 83 [2025-01-10 02:32:02,626 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 02:32:02,627 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:32:02,627 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:32:02,628 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:32:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 02:32:02,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2025-01-10 02:32:02,639 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:32:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2025-01-10 02:32:02,640 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 25 [2025-01-10 02:32:02,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:02,640 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2025-01-10 02:32:02,640 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:32:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2025-01-10 02:32:02,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 02:32:02,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:02,641 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:32:02,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:32:02,641 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:32:02,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:02,643 INFO L85 PathProgramCache]: Analyzing trace with hash -473230649, now seen corresponding path program 1 times [2025-01-10 02:32:02,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:02,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85955935] [2025-01-10 02:32:02,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:02,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:02,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 02:32:02,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 02:32:02,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:02,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:02,705 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:32:02,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:02,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85955935] [2025-01-10 02:32:02,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85955935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:32:02,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:32:02,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:32:02,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704756693] [2025-01-10 02:32:02,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:32:02,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:32:02,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:02,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:32:02,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:32:02,707 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:32:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:02,754 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2025-01-10 02:32:02,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:32:02,756 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:32:02,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:02,757 INFO L225 Difference]: With dead ends: 83 [2025-01-10 02:32:02,757 INFO L226 Difference]: Without dead ends: 81 [2025-01-10 02:32:02,757 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:32:02,758 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:32:02,758 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:32:02,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-10 02:32:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-01-10 02:32:02,775 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:32:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2025-01-10 02:32:02,777 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 29 [2025-01-10 02:32:02,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:02,778 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2025-01-10 02:32:02,778 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:32:02,778 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2025-01-10 02:32:02,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 02:32:02,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:02,779 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:32:02,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:32:02,779 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:32:02,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:02,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1773385638, now seen corresponding path program 1 times [2025-01-10 02:32:02,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:02,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484573322] [2025-01-10 02:32:02,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:02,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:02,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:32:02,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:32:02,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:02,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:02,852 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:32:02,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:02,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484573322] [2025-01-10 02:32:02,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484573322] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:32:02,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147685622] [2025-01-10 02:32:02,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:02,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:02,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:02,855 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:32:02,856 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:32:02,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:32:02,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:32:02,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:02,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:02,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:32:02,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:32:03,000 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:32:03,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:32:03,205 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:32:03,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147685622] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:32:03,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:32:03,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-01-10 02:32:03,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249608333] [2025-01-10 02:32:03,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:32:03,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 02:32:03,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:03,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 02:32:03,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-01-10 02:32:03,208 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:32:03,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:03,564 INFO L93 Difference]: Finished difference Result 187 states and 250 transitions. [2025-01-10 02:32:03,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 02:32:03,565 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:32:03,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:03,566 INFO L225 Difference]: With dead ends: 187 [2025-01-10 02:32:03,566 INFO L226 Difference]: Without dead ends: 118 [2025-01-10 02:32:03,568 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:32:03,568 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.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:32:03,568 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.3s Time] [2025-01-10 02:32:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-10 02:32:03,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2025-01-10 02:32:03,586 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:32:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2025-01-10 02:32:03,588 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 30 [2025-01-10 02:32:03,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:03,588 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2025-01-10 02:32:03,589 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:32:03,589 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2025-01-10 02:32:03,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 02:32:03,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:03,590 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:32:03,595 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:32:03,790 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:32:03,790 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:32:03,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:03,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1796117801, now seen corresponding path program 1 times [2025-01-10 02:32:03,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:03,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717488219] [2025-01-10 02:32:03,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:03,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:03,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 02:32:03,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 02:32:03,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:03,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:03,852 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:32:03,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:03,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717488219] [2025-01-10 02:32:03,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717488219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:32:03,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:32:03,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:32:03,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853300308] [2025-01-10 02:32:03,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:32:03,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 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,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:32:03,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:32:03,855 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:32:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:03,886 INFO L93 Difference]: Finished difference Result 138 states and 189 transitions. [2025-01-10 02:32:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:32:03,887 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:32:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:03,888 INFO L225 Difference]: With dead ends: 138 [2025-01-10 02:32:03,888 INFO L226 Difference]: Without dead ends: 136 [2025-01-10 02:32:03,888 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:32:03,889 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:32:03,889 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:32:03,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-10 02:32:03,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2025-01-10 02:32:03,909 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:32:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 165 transitions. [2025-01-10 02:32:03,910 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 165 transitions. Word has length 31 [2025-01-10 02:32:03,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:03,911 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 165 transitions. [2025-01-10 02:32:03,911 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:32:03,911 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 165 transitions. [2025-01-10 02:32:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 02:32:03,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:03,914 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:32:03,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:32:03,915 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:32:03,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash 516283740, now seen corresponding path program 1 times [2025-01-10 02:32:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:03,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254022485] [2025-01-10 02:32:03,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:03,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:03,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 02:32:03,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:32:03,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:03,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:03,999 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:32:04,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:04,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254022485] [2025-01-10 02:32:04,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254022485] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:32:04,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763078270] [2025-01-10 02:32:04,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:04,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:04,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:04,002 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:32:04,009 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:32:04,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 02:32:04,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:32:04,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:04,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:04,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 02:32:04,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:32:04,168 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:32:04,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:32:04,323 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:32:04,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763078270] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:32:04,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:32:04,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 16 [2025-01-10 02:32:04,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084096787] [2025-01-10 02:32:04,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:32:04,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 02:32:04,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:04,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 02:32:04,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:32:04,325 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:32:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:04,705 INFO L93 Difference]: Finished difference Result 263 states and 352 transitions. [2025-01-10 02:32:04,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 02:32:04,706 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:32:04,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:04,708 INFO L225 Difference]: With dead ends: 263 [2025-01-10 02:32:04,709 INFO L226 Difference]: Without dead ends: 154 [2025-01-10 02:32:04,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-01-10 02:32:04,711 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:32:04,713 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:32:04,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-10 02:32:04,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 139. [2025-01-10 02:32:04,731 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:32:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 186 transitions. [2025-01-10 02:32:04,734 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 186 transitions. Word has length 36 [2025-01-10 02:32:04,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:04,735 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 186 transitions. [2025-01-10 02:32:04,735 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:32:04,735 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 186 transitions. [2025-01-10 02:32:04,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 02:32:04,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:04,738 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:32:04,745 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:32:04,942 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:32:04,942 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:32:04,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:04,943 INFO L85 PathProgramCache]: Analyzing trace with hash 311039018, now seen corresponding path program 2 times [2025-01-10 02:32:04,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:04,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739233015] [2025-01-10 02:32:04,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:32:04,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:04,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 02:32:04,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:32:04,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:32:04,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:05,006 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:32:05,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:05,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739233015] [2025-01-10 02:32:05,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739233015] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:32:05,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854169827] [2025-01-10 02:32:05,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:32:05,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:05,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:05,009 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:32:05,011 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:32:05,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 02:32:05,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:32:05,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:32:05,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:05,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:32:05,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:32:05,089 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:32:05,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:32:05,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854169827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:32:05,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:32:05,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-10 02:32:05,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423368118] [2025-01-10 02:32:05,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:32:05,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:32:05,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:05,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:32:05,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:32:05,090 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:32:05,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:05,120 INFO L93 Difference]: Finished difference Result 146 states and 196 transitions. [2025-01-10 02:32:05,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:32:05,121 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:32:05,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:05,122 INFO L225 Difference]: With dead ends: 146 [2025-01-10 02:32:05,122 INFO L226 Difference]: Without dead ends: 145 [2025-01-10 02:32:05,122 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:32:05,122 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:32:05,123 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:32:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-10 02:32:05,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2025-01-10 02:32:05,136 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:32:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 190 transitions. [2025-01-10 02:32:05,140 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 190 transitions. Word has length 36 [2025-01-10 02:32:05,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:05,140 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 190 transitions. [2025-01-10 02:32:05,140 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:32:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 190 transitions. [2025-01-10 02:32:05,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 02:32:05,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:05,141 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:32:05,148 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:32:05,341 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:32:05,341 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:32:05,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:05,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1052275065, now seen corresponding path program 1 times [2025-01-10 02:32:05,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:05,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586208324] [2025-01-10 02:32:05,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:05,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:05,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 02:32:05,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 02:32:05,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:05,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:05,413 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:32:05,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:05,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586208324] [2025-01-10 02:32:05,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586208324] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:32:05,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632551725] [2025-01-10 02:32:05,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:05,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:05,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:05,416 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:32:05,419 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:32:05,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 02:32:05,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 02:32:05,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:05,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:05,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:32:05,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:32:05,505 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:32:05,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:32:05,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632551725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:32:05,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:32:05,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-01-10 02:32:05,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102819517] [2025-01-10 02:32:05,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:32:05,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:32:05,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:05,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:32:05,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:32:05,507 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:32:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:05,545 INFO L93 Difference]: Finished difference Result 159 states and 211 transitions. [2025-01-10 02:32:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:32:05,546 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:32:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:05,547 INFO L225 Difference]: With dead ends: 159 [2025-01-10 02:32:05,547 INFO L226 Difference]: Without dead ends: 158 [2025-01-10 02:32:05,548 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:32:05,548 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:32:05,549 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:32:05,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-01-10 02:32:05,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 139. [2025-01-10 02:32:05,559 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:32:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 183 transitions. [2025-01-10 02:32:05,561 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 183 transitions. Word has length 37 [2025-01-10 02:32:05,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:05,562 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 183 transitions. [2025-01-10 02:32:05,562 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:32:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 183 transitions. [2025-01-10 02:32:05,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 02:32:05,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:05,563 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:32:05,571 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:32:05,763 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:32:05,764 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:32:05,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:05,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1843083636, now seen corresponding path program 1 times [2025-01-10 02:32:05,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:05,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358340300] [2025-01-10 02:32:05,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:05,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:05,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 02:32:05,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 02:32:05,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:05,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:05,831 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:32:05,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:05,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358340300] [2025-01-10 02:32:05,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358340300] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:32:05,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439037570] [2025-01-10 02:32:05,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:05,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:05,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:05,834 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:32:05,836 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:32:05,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 02:32:05,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 02:32:05,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:05,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:05,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 02:32:05,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:32:05,993 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:32:05,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:32:06,117 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:32:06,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439037570] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:32:06,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:32:06,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 15 [2025-01-10 02:32:06,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078067932] [2025-01-10 02:32:06,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:32:06,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 02:32:06,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:06,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 02:32:06,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:32:06,118 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:32:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:06,429 INFO L93 Difference]: Finished difference Result 269 states and 368 transitions. [2025-01-10 02:32:06,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 02:32:06,430 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:32:06,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:06,431 INFO L225 Difference]: With dead ends: 269 [2025-01-10 02:32:06,431 INFO L226 Difference]: Without dead ends: 155 [2025-01-10 02:32:06,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 86 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2025-01-10 02:32:06,433 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:32:06,433 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:32:06,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-10 02:32:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2025-01-10 02:32:06,441 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:32:06,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 165 transitions. [2025-01-10 02:32:06,442 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 165 transitions. Word has length 51 [2025-01-10 02:32:06,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:06,442 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 165 transitions. [2025-01-10 02:32:06,442 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:32:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 165 transitions. [2025-01-10 02:32:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 02:32:06,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:06,443 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:32:06,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 02:32:06,643 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:32:06,644 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:32:06,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:06,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2124162897, now seen corresponding path program 1 times [2025-01-10 02:32:06,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:06,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492174694] [2025-01-10 02:32:06,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:06,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:06,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 02:32:06,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 02:32:06,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:06,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:06,699 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:32:06,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:06,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492174694] [2025-01-10 02:32:06,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492174694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:32:06,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:32:06,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:32:06,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622603015] [2025-01-10 02:32:06,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:32:06,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:32:06,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:06,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:32:06,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:32:06,700 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:32:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:06,729 INFO L93 Difference]: Finished difference Result 152 states and 187 transitions. [2025-01-10 02:32:06,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:32:06,729 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:32:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:06,730 INFO L225 Difference]: With dead ends: 152 [2025-01-10 02:32:06,730 INFO L226 Difference]: Without dead ends: 151 [2025-01-10 02:32:06,730 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:06,731 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:32:06,731 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:32:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-10 02:32:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 141. [2025-01-10 02:32:06,738 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:32:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 171 transitions. [2025-01-10 02:32:06,739 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 171 transitions. Word has length 50 [2025-01-10 02:32:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:06,740 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 171 transitions. [2025-01-10 02:32:06,740 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:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 171 transitions. [2025-01-10 02:32:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 02:32:06,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:06,741 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:32:06,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 02:32:06,741 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:32:06,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:06,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1424540440, now seen corresponding path program 1 times [2025-01-10 02:32:06,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:06,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649758414] [2025-01-10 02:32:06,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:06,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:06,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 02:32:06,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 02:32:06,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:06,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:06,853 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:32:06,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:06,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649758414] [2025-01-10 02:32:06,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649758414] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:32:06,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25074210] [2025-01-10 02:32:06,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:06,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:06,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:06,856 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:32:06,858 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:32:06,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 02:32:06,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 02:32:06,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:06,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:06,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:32:06,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:32:07,008 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:32:07,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:32:07,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25074210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:32:07,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:32:07,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2025-01-10 02:32:07,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558251274] [2025-01-10 02:32:07,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:32:07,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:32:07,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:07,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:32:07,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:32:07,010 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:32:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:07,067 INFO L93 Difference]: Finished difference Result 182 states and 240 transitions. [2025-01-10 02:32:07,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:32:07,068 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:32:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:07,069 INFO L225 Difference]: With dead ends: 182 [2025-01-10 02:32:07,069 INFO L226 Difference]: Without dead ends: 181 [2025-01-10 02:32:07,069 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:32:07,070 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:32:07,070 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:32:07,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-10 02:32:07,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 166. [2025-01-10 02:32:07,080 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:32:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 216 transitions. [2025-01-10 02:32:07,082 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 216 transitions. Word has length 51 [2025-01-10 02:32:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:07,082 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 216 transitions. [2025-01-10 02:32:07,082 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:32:07,082 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 216 transitions. [2025-01-10 02:32:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 02:32:07,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:07,083 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:32:07,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 02:32:07,283 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:32:07,284 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:32:07,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:07,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1919929995, now seen corresponding path program 1 times [2025-01-10 02:32:07,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:07,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551591026] [2025-01-10 02:32:07,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:07,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:07,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 02:32:07,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 02:32:07,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:07,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:07,342 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:32:07,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:07,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551591026] [2025-01-10 02:32:07,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551591026] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:32:07,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697663703] [2025-01-10 02:32:07,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:07,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:07,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:07,345 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:32:07,348 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:32:07,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 02:32:07,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 02:32:07,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:07,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:07,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 02:32:07,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:32:07,530 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:32:07,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:32:07,755 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:32:07,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697663703] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:32:07,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:32:07,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 13] total 26 [2025-01-10 02:32:07,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010403055] [2025-01-10 02:32:07,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:32:07,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 02:32:07,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:07,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 02:32:07,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2025-01-10 02:32:07,757 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:32:08,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:08,254 INFO L93 Difference]: Finished difference Result 279 states and 369 transitions. [2025-01-10 02:32:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 02:32:08,255 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:32:08,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:08,256 INFO L225 Difference]: With dead ends: 279 [2025-01-10 02:32:08,256 INFO L226 Difference]: Without dead ends: 152 [2025-01-10 02:32:08,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=1135, Unknown=0, NotChecked=0, Total=1332 [2025-01-10 02:32:08,258 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 164 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:32:08,258 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.3s Time] [2025-01-10 02:32:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-10 02:32:08,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2025-01-10 02:32:08,268 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:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2025-01-10 02:32:08,270 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 60 [2025-01-10 02:32:08,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:08,270 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2025-01-10 02:32:08,270 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:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2025-01-10 02:32:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 02:32:08,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:08,271 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:08,279 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:08,475 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:08,475 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:08,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:08,476 INFO L85 PathProgramCache]: Analyzing trace with hash -814175986, now seen corresponding path program 1 times [2025-01-10 02:32:08,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:08,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484809125] [2025-01-10 02:32:08,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:08,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:08,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 02:32:08,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 02:32:08,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:08,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:08,530 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:08,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:08,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484809125] [2025-01-10 02:32:08,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484809125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:32:08,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:32:08,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:32:08,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708055668] [2025-01-10 02:32:08,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:32:08,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:32:08,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:08,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:32:08,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:32:08,532 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:08,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:08,558 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2025-01-10 02:32:08,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:32:08,558 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:08,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:08,560 INFO L225 Difference]: With dead ends: 151 [2025-01-10 02:32:08,560 INFO L226 Difference]: Without dead ends: 150 [2025-01-10 02:32:08,560 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:08,560 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:08,560 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:08,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-10 02:32:08,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2025-01-10 02:32:08,568 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:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2025-01-10 02:32:08,569 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 55 [2025-01-10 02:32:08,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:08,570 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2025-01-10 02:32:08,570 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:08,570 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2025-01-10 02:32:08,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 02:32:08,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:08,571 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:08,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 02:32:08,571 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:08,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:08,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1958736820, now seen corresponding path program 1 times [2025-01-10 02:32:08,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:08,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23974748] [2025-01-10 02:32:08,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:08,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:08,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 02:32:08,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 02:32:08,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:08,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:08,699 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:08,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:08,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23974748] [2025-01-10 02:32:08,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23974748] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:32:08,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037190019] [2025-01-10 02:32:08,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:08,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:08,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:08,701 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:08,703 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:08,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 02:32:08,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 02:32:08,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:08,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:08,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:32:08,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:32:08,861 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:08,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:32:09,093 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:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037190019] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:32:09,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:32:09,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 23 [2025-01-10 02:32:09,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892134972] [2025-01-10 02:32:09,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:32:09,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 02:32:09,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:09,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 02:32:09,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2025-01-10 02:32:09,095 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:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:09,682 INFO L93 Difference]: Finished difference Result 259 states and 296 transitions. [2025-01-10 02:32:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 02:32:09,682 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:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:09,684 INFO L225 Difference]: With dead ends: 259 [2025-01-10 02:32:09,684 INFO L226 Difference]: Without dead ends: 161 [2025-01-10 02:32:09,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=1490, Unknown=0, NotChecked=0, Total=1722 [2025-01-10 02:32:09,686 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.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:32:09,686 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.3s Time] [2025-01-10 02:32:09,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-10 02:32:09,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 139. [2025-01-10 02:32:09,696 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:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2025-01-10 02:32:09,697 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 68 [2025-01-10 02:32:09,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:09,697 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2025-01-10 02:32:09,697 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:09,697 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2025-01-10 02:32:09,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-10 02:32:09,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:09,699 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:09,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 02:32:09,900 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:09,900 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:09,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:09,901 INFO L85 PathProgramCache]: Analyzing trace with hash 103911917, now seen corresponding path program 1 times [2025-01-10 02:32:09,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:09,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65457906] [2025-01-10 02:32:09,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:09,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:09,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 02:32:09,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 02:32:09,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:09,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:10,088 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:10,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:10,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65457906] [2025-01-10 02:32:10,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65457906] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:32:10,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17683180] [2025-01-10 02:32:10,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:10,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:10,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:10,092 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:10,094 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:10,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 02:32:10,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 02:32:10,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:10,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:10,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 02:32:10,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:32:10,303 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:10,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:32:10,732 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:10,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17683180] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:32:10,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:32:10,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 11] total 28 [2025-01-10 02:32:10,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105485985] [2025-01-10 02:32:10,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:32:10,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 02:32:10,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:10,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 02:32:10,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2025-01-10 02:32:10,734 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:11,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:11,491 INFO L93 Difference]: Finished difference Result 234 states and 257 transitions. [2025-01-10 02:32:11,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-10 02:32:11,492 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:11,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:11,493 INFO L225 Difference]: With dead ends: 234 [2025-01-10 02:32:11,493 INFO L226 Difference]: Without dead ends: 111 [2025-01-10 02:32:11,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=339, Invalid=2417, Unknown=0, NotChecked=0, Total=2756 [2025-01-10 02:32:11,495 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 101 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:32:11,495 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.4s Time] [2025-01-10 02:32:11,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-10 02:32:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2025-01-10 02:32:11,501 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:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2025-01-10 02:32:11,502 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 69 [2025-01-10 02:32:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:11,502 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2025-01-10 02:32:11,503 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:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2025-01-10 02:32:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-10 02:32:11,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:11,504 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:11,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 02:32:11,704 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:11,704 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:11,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:11,705 INFO L85 PathProgramCache]: Analyzing trace with hash 397031206, now seen corresponding path program 1 times [2025-01-10 02:32:11,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:11,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548355125] [2025-01-10 02:32:11,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:11,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:11,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-10 02:32:11,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-10 02:32:11,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:11,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:11,983 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:11,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:11,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548355125] [2025-01-10 02:32:11,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548355125] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:32:11,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000817393] [2025-01-10 02:32:11,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:11,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:11,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:11,986 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:11,989 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:12,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-10 02:32:12,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-10 02:32:12,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:12,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:12,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 02:32:12,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:32:12,219 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:12,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:32:12,721 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:12,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000817393] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:32:12,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:32:12,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 15] total 33 [2025-01-10 02:32:12,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795434657] [2025-01-10 02:32:12,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:32:12,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-10 02:32:12,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:12,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-10 02:32:12,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2025-01-10 02:32:12,723 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:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:12,919 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2025-01-10 02:32:12,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 02:32:12,919 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:12,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:12,920 INFO L225 Difference]: With dead ends: 114 [2025-01-10 02:32:12,920 INFO L226 Difference]: Without dead ends: 113 [2025-01-10 02:32:12,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=1221, Unknown=0, NotChecked=0, Total=1406 [2025-01-10 02:32:12,922 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:12,922 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:12,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-10 02:32:12,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2025-01-10 02:32:12,927 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:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2025-01-10 02:32:12,928 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 83 [2025-01-10 02:32:12,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:12,928 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2025-01-10 02:32:12,929 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:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2025-01-10 02:32:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 02:32:12,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:32:12,930 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:12,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 02:32:13,134 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:13,134 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:13,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:32:13,135 INFO L85 PathProgramCache]: Analyzing trace with hash -576934403, now seen corresponding path program 1 times [2025-01-10 02:32:13,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:32:13,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345783436] [2025-01-10 02:32:13,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:13,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:32:13,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 02:32:13,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 02:32:13,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:13,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:13,403 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:13,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:32:13,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345783436] [2025-01-10 02:32:13,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345783436] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:32:13,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037793373] [2025-01-10 02:32:13,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:32:13,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:32:13,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:32:13,406 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:13,408 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:13,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 02:32:13,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 02:32:13,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:32:13,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:32:13,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 02:32:13,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:32:13,623 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:13,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:32:14,076 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:14,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037793373] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:32:14,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:32:14,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 16] total 33 [2025-01-10 02:32:14,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144663707] [2025-01-10 02:32:14,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:32:14,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-10 02:32:14,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:32:14,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-10 02:32:14,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2025-01-10 02:32:14,079 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:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:32:14,180 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2025-01-10 02:32:14,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 02:32:14,182 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:14,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:32:14,182 INFO L225 Difference]: With dead ends: 110 [2025-01-10 02:32:14,183 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:32:14,183 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:14,185 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:14,185 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:14,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:32:14,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:32:14,185 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:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:32:14,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2025-01-10 02:32:14,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:32:14,186 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:32:14,186 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:14,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:32:14,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:32:14,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-01-10 02:32:14,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-01-10 02:32:14,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-01-10 02:32:14,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-01-10 02:32:14,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-01-10 02:32:14,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-01-10 02:32:14,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-01-10 02:32:14,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-01-10 02:32:14,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-01-10 02:32:14,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-01-10 02:32:14,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-01-10 02:32:14,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-01-10 02:32:14,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 02:32:14,390 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:14,393 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:14,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:32:15,628 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:32:15,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:32:15 BoogieIcfgContainer [2025-01-10 02:32:15,632 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:32:15,633 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:32:15,633 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:32:15,633 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:32:15,633 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:32:00" (3/4) ... [2025-01-10 02:32:15,635 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 02:32:15,639 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2025-01-10 02:32:15,639 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2025-01-10 02:32:15,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-10 02:32:15,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 02:32:15,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 02:32:15,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 02:32:15,706 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:32:15,706 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:32:15,707 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:32:15,708 INFO L158 Benchmark]: Toolchain (without parser) took 15511.69ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 123.4MB in the beginning and 117.5MB in the end (delta: 5.8MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. [2025-01-10 02:32:15,708 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:32:15,709 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.25ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 112.7MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:32:15,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.11ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:32:15,712 INFO L158 Benchmark]: Boogie Preprocessor took 38.75ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 110.6MB in the end (delta: 682.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:32:15,712 INFO L158 Benchmark]: RCFGBuilder took 316.05ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 98.1MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 02:32:15,715 INFO L158 Benchmark]: TraceAbstraction took 14850.42ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 97.4MB in the beginning and 123.2MB in the end (delta: -25.8MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2025-01-10 02:32:15,715 INFO L158 Benchmark]: Witness Printer took 73.84ms. Allocated memory is still 234.9MB. Free memory was 123.2MB in the beginning and 117.5MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:32:15,716 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.84ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.25ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 112.7MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.11ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.75ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 110.6MB in the end (delta: 682.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 316.05ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 98.1MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14850.42ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 97.4MB in the beginning and 123.2MB in the end (delta: -25.8MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. * Witness Printer took 73.84ms. Allocated memory is still 234.9MB. Free memory was 123.2MB in the beginning and 117.5MB in the end (delta: 5.7MB). 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: 13.5s, OverallIterations: 22, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 867 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 839 mSDsluCounter, 5103 SdHoareTripleChecker+Invalid, 2.1s 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.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1341 GetRequests, 982 SyntacticMatches, 35 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 3.4s 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.8s 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:15,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE