./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0724aefed4fd629206cc51e19e964e04af92729823366947a0cfe01fe4e4d102 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:41:31,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:41:31,181 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:41:31,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:41:31,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:41:31,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:41:31,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:41:31,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:41:31,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:41:31,214 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:41:31,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:41:31,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:41:31,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:41:31,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:41:31,215 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:41:31,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:41:31,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:41:31,216 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:41:31,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:41:31,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:41:31,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:41:31,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:41:31,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:41:31,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:41:31,216 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:41:31,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:41:31,216 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:41:31,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:41:31,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:41:31,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:41:31,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:41:31,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:41:31,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:41:31,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:41:31,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:41:31,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:41:31,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:41:31,218 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:41:31,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:41:31,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:41:31,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:41:31,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:41:31,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:41:31,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:41:31,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:41:31,219 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0724aefed4fd629206cc51e19e964e04af92729823366947a0cfe01fe4e4d102 [2025-03-09 02:41:31,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:41:31,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:41:31,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:41:31,467 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:41:31,467 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:41:31,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2025-03-09 02:41:32,601 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0222212a8/a18243beca304daa920d040fa842e7c8/FLAG5571d4a23 [2025-03-09 02:41:32,818 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:41:32,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2025-03-09 02:41:32,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0222212a8/a18243beca304daa920d040fa842e7c8/FLAG5571d4a23 [2025-03-09 02:41:33,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0222212a8/a18243beca304daa920d040fa842e7c8 [2025-03-09 02:41:33,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:41:33,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:41:33,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:41:33,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:41:33,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:41:33,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:41:33" (1/1) ... [2025-03-09 02:41:33,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45a8d296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:33, skipping insertion in model container [2025-03-09 02:41:33,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:41:33" (1/1) ... [2025-03-09 02:41:33,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:41:33,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:41:33,300 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:41:33,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:41:33,323 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:41:33,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:33 WrapperNode [2025-03-09 02:41:33,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:41:33,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:41:33,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:41:33,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:41:33,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:33" (1/1) ... [2025-03-09 02:41:33,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:33" (1/1) ... [2025-03-09 02:41:33,345 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2025-03-09 02:41:33,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:41:33,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:41:33,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:41:33,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:41:33,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:33" (1/1) ... [2025-03-09 02:41:33,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:33" (1/1) ... [2025-03-09 02:41:33,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:33" (1/1) ... [2025-03-09 02:41:33,368 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-03-09 02:41:33,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:33" (1/1) ... [2025-03-09 02:41:33,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:33" (1/1) ... [2025-03-09 02:41:33,371 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:33" (1/1) ... [2025-03-09 02:41:33,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:33" (1/1) ... [2025-03-09 02:41:33,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:33" (1/1) ... [2025-03-09 02:41:33,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:33" (1/1) ... [2025-03-09 02:41:33,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:41:33,377 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:41:33,377 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:41:33,377 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:41:33,378 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:33" (1/1) ... [2025-03-09 02:41:33,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:41:33,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:33,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:41:33,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:41:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:41:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:41:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2025-03-09 02:41:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2025-03-09 02:41:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2025-03-09 02:41:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2025-03-09 02:41:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:41:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:41:33,470 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:41:33,471 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:41:33,558 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~ret6;havoc #t~ret7; [2025-03-09 02:41:33,578 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: havoc #t~ret4;havoc #t~ret5; [2025-03-09 02:41:33,586 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-09 02:41:33,586 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:41:33,594 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:41:33,595 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:41:33,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:41:33 BoogieIcfgContainer [2025-03-09 02:41:33,596 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:41:33,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:41:33,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:41:33,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:41:33,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:41:33" (1/3) ... [2025-03-09 02:41:33,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6022b48a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:41:33, skipping insertion in model container [2025-03-09 02:41:33,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:33" (2/3) ... [2025-03-09 02:41:33,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6022b48a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:41:33, skipping insertion in model container [2025-03-09 02:41:33,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:41:33" (3/3) ... [2025-03-09 02:41:33,602 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2025-03-09 02:41:33,611 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:41:33,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_2calls_4-1.c that has 3 procedures, 53 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-09 02:41:33,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:41:33,661 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;@5eb97542, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:41:33,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-09 02:41:33,664 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-03-09 02:41:33,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 02:41:33,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:33,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:33,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:33,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:33,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1954105288, now seen corresponding path program 1 times [2025-03-09 02:41:33,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:33,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272870831] [2025-03-09 02:41:33,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:33,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:33,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 02:41:33,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 02:41:33,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:33,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:33,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:33,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:33,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272870831] [2025-03-09 02:41:33,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272870831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:33,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:33,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:41:33,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474645155] [2025-03-09 02:41:33,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:33,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:41:33,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:33,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:41:33,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:41:33,806 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-03-09 02:41:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:33,840 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-03-09 02:41:33,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:41:33,842 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-03-09 02:41:33,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:33,847 INFO L225 Difference]: With dead ends: 59 [2025-03-09 02:41:33,847 INFO L226 Difference]: Without dead ends: 45 [2025-03-09 02:41:33,849 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-03-09 02:41:33,850 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-03-09 02:41:33,851 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-03-09 02:41:33,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-09 02:41:33,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-03-09 02:41:33,877 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-03-09 02:41:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-09 02:41:33,885 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 7 [2025-03-09 02:41:33,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:33,885 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-09 02:41:33,886 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-03-09 02:41:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-03-09 02:41:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:41:33,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:33,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:33,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:41:33,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:33,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:33,888 INFO L85 PathProgramCache]: Analyzing trace with hash -447721764, now seen corresponding path program 1 times [2025-03-09 02:41:33,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:33,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592790474] [2025-03-09 02:41:33,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:33,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:33,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:41:33,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:41:33,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:33,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:33,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:33,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592790474] [2025-03-09 02:41:33,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592790474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:33,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:33,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:33,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489945761] [2025-03-09 02:41:33,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:33,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:33,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:33,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:33,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:33,971 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-03-09 02:41:34,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:34,026 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2025-03-09 02:41:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:34,027 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-03-09 02:41:34,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:34,027 INFO L225 Difference]: With dead ends: 64 [2025-03-09 02:41:34,027 INFO L226 Difference]: Without dead ends: 58 [2025-03-09 02:41:34,028 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-03-09 02:41:34,028 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 26 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:34,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 164 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:34,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-09 02:41:34,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-03-09 02:41:34,034 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-03-09 02:41:34,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2025-03-09 02:41:34,036 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 8 [2025-03-09 02:41:34,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:34,036 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2025-03-09 02:41:34,036 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-03-09 02:41:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2025-03-09 02:41:34,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 02:41:34,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:34,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:34,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:41:34,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibo2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:34,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:34,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2145956475, now seen corresponding path program 1 times [2025-03-09 02:41:34,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:34,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484179550] [2025-03-09 02:41:34,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:34,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:34,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 02:41:34,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 02:41:34,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:34,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:34,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:34,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484179550] [2025-03-09 02:41:34,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484179550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:34,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:34,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:41:34,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719424107] [2025-03-09 02:41:34,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:34,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:41:34,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:34,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:41:34,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:41:34,074 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-03-09 02:41:34,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:34,097 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2025-03-09 02:41:34,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:41:34,098 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-03-09 02:41:34,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:34,098 INFO L225 Difference]: With dead ends: 58 [2025-03-09 02:41:34,098 INFO L226 Difference]: Without dead ends: 56 [2025-03-09 02:41:34,099 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-03-09 02:41:34,099 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-03-09 02:41:34,099 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-03-09 02:41:34,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-09 02:41:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-03-09 02:41:34,104 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-03-09 02:41:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-03-09 02:41:34,105 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 13 [2025-03-09 02:41:34,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:34,105 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-03-09 02:41:34,105 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-03-09 02:41:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-03-09 02:41:34,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 02:41:34,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:34,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:34,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:41:34,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:34,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:34,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2100141288, now seen corresponding path program 1 times [2025-03-09 02:41:34,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:34,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967916640] [2025-03-09 02:41:34,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:34,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:34,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 02:41:34,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 02:41:34,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:34,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:34,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:34,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967916640] [2025-03-09 02:41:34,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967916640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:34,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:34,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:41:34,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997591532] [2025-03-09 02:41:34,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:34,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:41:34,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:34,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:41:34,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:41:34,203 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-03-09 02:41:34,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:34,315 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2025-03-09 02:41:34,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:41:34,315 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-03-09 02:41:34,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:34,316 INFO L225 Difference]: With dead ends: 58 [2025-03-09 02:41:34,316 INFO L226 Difference]: Without dead ends: 54 [2025-03-09 02:41:34,316 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-03-09 02:41:34,317 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-03-09 02:41:34,317 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-03-09 02:41:34,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-09 02:41:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2025-03-09 02:41:34,323 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-03-09 02:41:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-03-09 02:41:34,324 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 14 [2025-03-09 02:41:34,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:34,324 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-03-09 02:41:34,324 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-03-09 02:41:34,324 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-03-09 02:41:34,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 02:41:34,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:34,325 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-03-09 02:41:34,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:41:34,325 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:34,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:34,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1831817774, now seen corresponding path program 1 times [2025-03-09 02:41:34,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:34,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368860138] [2025-03-09 02:41:34,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:34,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:34,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 02:41:34,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 02:41:34,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:34,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:41:34,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:34,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368860138] [2025-03-09 02:41:34,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368860138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:34,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:34,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:34,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616133407] [2025-03-09 02:41:34,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:34,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:34,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:34,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:34,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:34,446 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-03-09 02:41:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:34,478 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2025-03-09 02:41:34,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:34,478 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-03-09 02:41:34,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:34,479 INFO L225 Difference]: With dead ends: 74 [2025-03-09 02:41:34,480 INFO L226 Difference]: Without dead ends: 69 [2025-03-09 02:41:34,480 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-03-09 02:41:34,481 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-03-09 02:41:34,481 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-03-09 02:41:34,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-09 02:41:34,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-03-09 02:41:34,493 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-03-09 02:41:34,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2025-03-09 02:41:34,495 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 23 [2025-03-09 02:41:34,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:34,495 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2025-03-09 02:41:34,495 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-03-09 02:41:34,495 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2025-03-09 02:41:34,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 02:41:34,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:34,496 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-03-09 02:41:34,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:41:34,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:34,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:34,497 INFO L85 PathProgramCache]: Analyzing trace with hash -631666365, now seen corresponding path program 1 times [2025-03-09 02:41:34,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:34,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462481807] [2025-03-09 02:41:34,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:34,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:34,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:41:34,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:41:34,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:34,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:41:34,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:34,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462481807] [2025-03-09 02:41:34,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462481807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:34,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428799499] [2025-03-09 02:41:34,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:34,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:34,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:34,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:34,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:41:34,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:41:34,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:41:34,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:34,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:34,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:41:34,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:34,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:41:34,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428799499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:34,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:41:34,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2025-03-09 02:41:34,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333467216] [2025-03-09 02:41:34,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:34,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:41:34,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:34,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:41:34,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:41:34,691 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-03-09 02:41:34,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:34,787 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2025-03-09 02:41:34,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:41:34,788 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-03-09 02:41:34,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:34,789 INFO L225 Difference]: With dead ends: 117 [2025-03-09 02:41:34,789 INFO L226 Difference]: Without dead ends: 63 [2025-03-09 02:41:34,790 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-03-09 02:41:34,791 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:34,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 176 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:34,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-09 02:41:34,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-03-09 02:41:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.2) internal successors, (54), 49 states have internal predecessors, (54), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-09 02:41:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2025-03-09 02:41:34,797 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 24 [2025-03-09 02:41:34,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:34,797 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2025-03-09 02:41:34,798 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-03-09 02:41:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2025-03-09 02:41:34,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 02:41:34,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:34,798 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-03-09 02:41:34,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:41:35,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 02:41:35,000 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:35,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:35,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2003454357, now seen corresponding path program 1 times [2025-03-09 02:41:35,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:35,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884632224] [2025-03-09 02:41:35,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:35,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:35,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 02:41:35,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 02:41:35,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:35,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:41:35,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:35,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884632224] [2025-03-09 02:41:35,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884632224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:35,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:35,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:35,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237130419] [2025-03-09 02:41:35,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:35,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:35,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:35,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:35,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:35,074 INFO L87 Difference]: Start difference. First operand 61 states and 75 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-03-09 02:41:35,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:35,105 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2025-03-09 02:41:35,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:35,105 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-03-09 02:41:35,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:35,106 INFO L225 Difference]: With dead ends: 75 [2025-03-09 02:41:35,106 INFO L226 Difference]: Without dead ends: 73 [2025-03-09 02:41:35,106 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-03-09 02:41:35,106 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:35,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 148 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:35,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-09 02:41:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2025-03-09 02:41:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 56 states have internal predecessors, (61), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-09 02:41:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2025-03-09 02:41:35,112 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 29 [2025-03-09 02:41:35,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:35,112 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2025-03-09 02:41:35,112 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-03-09 02:41:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2025-03-09 02:41:35,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:41:35,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:35,113 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-03-09 02:41:35,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:41:35,113 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:35,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:35,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1424432597, now seen corresponding path program 1 times [2025-03-09 02:41:35,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:35,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485809597] [2025-03-09 02:41:35,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:35,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:35,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:41:35,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:41:35,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:35,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 02:41:35,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:35,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485809597] [2025-03-09 02:41:35,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485809597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:35,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102732939] [2025-03-09 02:41:35,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:35,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:35,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:35,186 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:35,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:41:35,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:41:35,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:41:35,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:35,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:35,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:41:35,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:35,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:35,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:41:35,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102732939] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:35,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:35,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-09 02:41:35,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767585343] [2025-03-09 02:41:35,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:35,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 02:41:35,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:35,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 02:41:35,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:41:35,452 INFO L87 Difference]: Start difference. First operand 70 states and 87 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-03-09 02:41:35,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:35,751 INFO L93 Difference]: Finished difference Result 175 states and 228 transitions. [2025-03-09 02:41:35,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:41:35,751 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-03-09 02:41:35,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:35,752 INFO L225 Difference]: With dead ends: 175 [2025-03-09 02:41:35,752 INFO L226 Difference]: Without dead ends: 114 [2025-03-09 02:41:35,753 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-03-09 02:41:35,754 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 120 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:35,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 464 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:41:35,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-09 02:41:35,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2025-03-09 02:41:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 80 states have internal predecessors, (89), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (26), 14 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-09 02:41:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 128 transitions. [2025-03-09 02:41:35,766 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 128 transitions. Word has length 30 [2025-03-09 02:41:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:35,767 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 128 transitions. [2025-03-09 02:41:35,767 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-03-09 02:41:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 128 transitions. [2025-03-09 02:41:35,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-09 02:41:35,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:35,768 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-03-09 02:41:35,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:35,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-09 02:41:35,968 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:35,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:35,970 INFO L85 PathProgramCache]: Analyzing trace with hash 853527359, now seen corresponding path program 1 times [2025-03-09 02:41:35,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:35,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848440676] [2025-03-09 02:41:35,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:35,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:35,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:41:35,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:41:35,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:35,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 02:41:36,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:36,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848440676] [2025-03-09 02:41:36,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848440676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:36,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:36,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:36,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943949681] [2025-03-09 02:41:36,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:36,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:36,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:36,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:36,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:36,045 INFO L87 Difference]: Start difference. First operand 100 states and 128 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-03-09 02:41:36,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:36,073 INFO L93 Difference]: Finished difference Result 132 states and 178 transitions. [2025-03-09 02:41:36,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:36,074 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-03-09 02:41:36,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:36,074 INFO L225 Difference]: With dead ends: 132 [2025-03-09 02:41:36,075 INFO L226 Difference]: Without dead ends: 130 [2025-03-09 02:41:36,075 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-03-09 02:41:36,075 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-03-09 02:41:36,075 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-03-09 02:41:36,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-09 02:41:36,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 118. [2025-03-09 02:41:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 91 states have (on average 1.1428571428571428) internal successors, (104), 93 states have internal predecessors, (104), 16 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (34), 19 states have call predecessors, (34), 15 states have call successors, (34) [2025-03-09 02:41:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 154 transitions. [2025-03-09 02:41:36,083 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 154 transitions. Word has length 31 [2025-03-09 02:41:36,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:36,083 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 154 transitions. [2025-03-09 02:41:36,084 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-03-09 02:41:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 154 transitions. [2025-03-09 02:41:36,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 02:41:36,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:36,084 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-03-09 02:41:36,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 02:41:36,085 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:36,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:36,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1904404842, now seen corresponding path program 1 times [2025-03-09 02:41:36,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:36,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890926162] [2025-03-09 02:41:36,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:36,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:36,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 02:41:36,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:41:36,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:36,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 02:41:36,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:36,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890926162] [2025-03-09 02:41:36,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890926162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:36,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576636234] [2025-03-09 02:41:36,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:36,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:36,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:36,169 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:36,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:41:36,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 02:41:36,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:41:36,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:36,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:36,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:41:36,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:36,237 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 02:41:36,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 02:41:36,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576636234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:36,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:36,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-03-09 02:41:36,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507274440] [2025-03-09 02:41:36,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:36,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:41:36,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:36,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:41:36,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:41:36,292 INFO L87 Difference]: Start difference. First operand 118 states and 154 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-09 02:41:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:36,377 INFO L93 Difference]: Finished difference Result 137 states and 182 transitions. [2025-03-09 02:41:36,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:41:36,378 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2025-03-09 02:41:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:36,379 INFO L225 Difference]: With dead ends: 137 [2025-03-09 02:41:36,379 INFO L226 Difference]: Without dead ends: 135 [2025-03-09 02:41:36,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:41:36,379 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 11 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:36,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 366 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:36,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-09 02:41:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 122. [2025-03-09 02:41:36,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 96 states have internal predecessors, (107), 16 states have call successors, (16), 5 states have call predecessors, (16), 8 states have return successors, (37), 20 states have call predecessors, (37), 15 states have call successors, (37) [2025-03-09 02:41:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 160 transitions. [2025-03-09 02:41:36,388 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 160 transitions. Word has length 36 [2025-03-09 02:41:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:36,388 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 160 transitions. [2025-03-09 02:41:36,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-09 02:41:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 160 transitions. [2025-03-09 02:41:36,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 02:41:36,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:36,390 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-09 02:41:36,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 02:41:36,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:36,590 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:36,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:36,591 INFO L85 PathProgramCache]: Analyzing trace with hash -708842864, now seen corresponding path program 1 times [2025-03-09 02:41:36,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:36,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946793688] [2025-03-09 02:41:36,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:36,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:36,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:41:36,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:41:36,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:36,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:36,656 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-09 02:41:36,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:36,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946793688] [2025-03-09 02:41:36,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946793688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:36,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962142588] [2025-03-09 02:41:36,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:36,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:36,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:36,658 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:36,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:41:36,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:41:36,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:41:36,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:36,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:36,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:41:36,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:41:36,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:41:36,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962142588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:36,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:36,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 14 [2025-03-09 02:41:36,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030874894] [2025-03-09 02:41:36,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:36,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 02:41:36,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:36,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 02:41:36,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:41:36,860 INFO L87 Difference]: Start difference. First operand 122 states and 160 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 02:41:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:37,095 INFO L93 Difference]: Finished difference Result 235 states and 306 transitions. [2025-03-09 02:41:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:41:37,096 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 46 [2025-03-09 02:41:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:37,097 INFO L225 Difference]: With dead ends: 235 [2025-03-09 02:41:37,097 INFO L226 Difference]: Without dead ends: 132 [2025-03-09 02:41:37,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:41:37,098 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 62 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:37,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 424 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:41:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-09 02:41:37,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 119. [2025-03-09 02:41:37,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 91 states have (on average 1.1428571428571428) internal successors, (104), 94 states have internal predecessors, (104), 16 states have call successors, (16), 5 states have call predecessors, (16), 8 states have return successors, (37), 19 states have call predecessors, (37), 15 states have call successors, (37) [2025-03-09 02:41:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 157 transitions. [2025-03-09 02:41:37,107 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 157 transitions. Word has length 46 [2025-03-09 02:41:37,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:37,107 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 157 transitions. [2025-03-09 02:41:37,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 02:41:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 157 transitions. [2025-03-09 02:41:37,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 02:41:37,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:37,108 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 02:41:37,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:37,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:37,309 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:37,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:37,310 INFO L85 PathProgramCache]: Analyzing trace with hash -535934519, now seen corresponding path program 1 times [2025-03-09 02:41:37,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:37,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847615614] [2025-03-09 02:41:37,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:37,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:37,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 02:41:37,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 02:41:37,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:37,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:37,371 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 02:41:37,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:37,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847615614] [2025-03-09 02:41:37,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847615614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:37,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:37,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:37,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377697038] [2025-03-09 02:41:37,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:37,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:37,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:37,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:37,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:37,373 INFO L87 Difference]: Start difference. First operand 119 states and 157 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-03-09 02:41:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:37,407 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2025-03-09 02:41:37,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:37,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 38 [2025-03-09 02:41:37,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:37,408 INFO L225 Difference]: With dead ends: 129 [2025-03-09 02:41:37,408 INFO L226 Difference]: Without dead ends: 128 [2025-03-09 02:41:37,409 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-03-09 02:41:37,409 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:37,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 182 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-09 02:41:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2025-03-09 02:41:37,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 89 states have internal predecessors, (100), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (31), 18 states have call predecessors, (31), 14 states have call successors, (31) [2025-03-09 02:41:37,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2025-03-09 02:41:37,426 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 38 [2025-03-09 02:41:37,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:37,426 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2025-03-09 02:41:37,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-03-09 02:41:37,426 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2025-03-09 02:41:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 02:41:37,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:37,427 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 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] [2025-03-09 02:41:37,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 02:41:37,427 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:37,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:37,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2027301652, now seen corresponding path program 1 times [2025-03-09 02:41:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:37,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732376923] [2025-03-09 02:41:37,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:37,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:37,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 02:41:37,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 02:41:37,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:37,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:37,514 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:41:37,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:37,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732376923] [2025-03-09 02:41:37,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732376923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:37,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734953739] [2025-03-09 02:41:37,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:37,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:37,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:37,516 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:37,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:41:37,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 02:41:37,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 02:41:37,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:37,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:37,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:41:37,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:41:37,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:41:37,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734953739] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:37,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:37,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 16 [2025-03-09 02:41:37,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208084079] [2025-03-09 02:41:37,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:37,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 02:41:37,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:37,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 02:41:37,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:41:37,770 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 13 states have internal predecessors, (68), 7 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 02:41:38,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:38,056 INFO L93 Difference]: Finished difference Result 258 states and 340 transitions. [2025-03-09 02:41:38,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 02:41:38,056 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 13 states have internal predecessors, (68), 7 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2025-03-09 02:41:38,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:38,057 INFO L225 Difference]: With dead ends: 258 [2025-03-09 02:41:38,057 INFO L226 Difference]: Without dead ends: 160 [2025-03-09 02:41:38,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 84 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:41:38,058 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 95 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:38,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 427 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:41:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-09 02:41:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2025-03-09 02:41:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 105 states have (on average 1.1428571428571428) internal successors, (120), 106 states have internal predecessors, (120), 17 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (39), 22 states have call predecessors, (39), 16 states have call successors, (39) [2025-03-09 02:41:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2025-03-09 02:41:38,065 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 50 [2025-03-09 02:41:38,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:38,065 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2025-03-09 02:41:38,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 13 states have internal predecessors, (68), 7 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 02:41:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2025-03-09 02:41:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 02:41:38,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:38,066 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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, 1, 1] [2025-03-09 02:41:38,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 02:41:38,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-09 02:41:38,267 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:38,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:38,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1453250303, now seen corresponding path program 1 times [2025-03-09 02:41:38,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:38,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108630807] [2025-03-09 02:41:38,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:38,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:38,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:41:38,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:41:38,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:38,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:41:38,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:38,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108630807] [2025-03-09 02:41:38,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108630807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:38,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757909096] [2025-03-09 02:41:38,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:38,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:38,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:38,367 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:38,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:41:38,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:41:38,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:41:38,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:38,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:38,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:41:38,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:41:38,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:41:38,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757909096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:38,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:38,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 12 [2025-03-09 02:41:38,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926817578] [2025-03-09 02:41:38,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:38,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:41:38,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:38,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:41:38,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:41:38,552 INFO L87 Difference]: Start difference. First operand 135 states and 176 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:41:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:38,693 INFO L93 Difference]: Finished difference Result 243 states and 332 transitions. [2025-03-09 02:41:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 02:41:38,694 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2025-03-09 02:41:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:38,694 INFO L225 Difference]: With dead ends: 243 [2025-03-09 02:41:38,694 INFO L226 Difference]: Without dead ends: 133 [2025-03-09 02:41:38,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 108 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-09 02:41:38,695 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 88 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:38,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 165 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:38,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-09 02:41:38,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2025-03-09 02:41:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 101 states have (on average 1.1485148514851484) internal successors, (116), 104 states have internal predecessors, (116), 17 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (31), 20 states have call predecessors, (31), 16 states have call successors, (31) [2025-03-09 02:41:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2025-03-09 02:41:38,703 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 57 [2025-03-09 02:41:38,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:38,703 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2025-03-09 02:41:38,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:41:38,703 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2025-03-09 02:41:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 02:41:38,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:38,703 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-03-09 02:41:38,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:41:38,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:38,908 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:38,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:38,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1878827636, now seen corresponding path program 1 times [2025-03-09 02:41:38,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:38,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249916533] [2025-03-09 02:41:38,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:38,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:38,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 02:41:38,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 02:41:38,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:38,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 02:41:38,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:38,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249916533] [2025-03-09 02:41:38,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249916533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:38,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:38,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:38,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018893977] [2025-03-09 02:41:38,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:38,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:38,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:38,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:38,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:38,962 INFO L87 Difference]: Start difference. First operand 131 states and 164 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-03-09 02:41:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:38,985 INFO L93 Difference]: Finished difference Result 148 states and 186 transitions. [2025-03-09 02:41:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:38,987 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-03-09 02:41:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:38,988 INFO L225 Difference]: With dead ends: 148 [2025-03-09 02:41:38,988 INFO L226 Difference]: Without dead ends: 147 [2025-03-09 02:41:38,988 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-03-09 02:41:38,988 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-03-09 02:41:38,988 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-03-09 02:41:38,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-09 02:41:38,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2025-03-09 02:41:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 107 states have internal predecessors, (122), 17 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (31), 23 states have call predecessors, (31), 16 states have call successors, (31) [2025-03-09 02:41:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2025-03-09 02:41:38,998 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 50 [2025-03-09 02:41:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:38,998 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2025-03-09 02:41:38,998 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-03-09 02:41:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2025-03-09 02:41:38,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 02:41:38,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:38,999 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-03-09 02:41:38,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 02:41:38,999 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:38,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:38,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1885885413, now seen corresponding path program 1 times [2025-03-09 02:41:38,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:38,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606289200] [2025-03-09 02:41:38,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:38,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:39,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 02:41:39,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 02:41:39,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:39,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-09 02:41:39,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:39,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606289200] [2025-03-09 02:41:39,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606289200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:39,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876045684] [2025-03-09 02:41:39,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:39,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:39,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:39,091 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:39,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 02:41:39,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 02:41:39,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 02:41:39,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:39,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:39,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:41:39,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 02:41:39,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:41:39,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876045684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:39,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:41:39,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2025-03-09 02:41:39,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419154217] [2025-03-09 02:41:39,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:39,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:41:39,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:39,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:41:39,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:41:39,198 INFO L87 Difference]: Start difference. First operand 137 states and 170 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-03-09 02:41:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:39,246 INFO L93 Difference]: Finished difference Result 178 states and 239 transitions. [2025-03-09 02:41:39,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:41:39,246 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-03-09 02:41:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:39,247 INFO L225 Difference]: With dead ends: 178 [2025-03-09 02:41:39,247 INFO L226 Difference]: Without dead ends: 177 [2025-03-09 02:41:39,248 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-03-09 02:41:39,248 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-03-09 02:41:39,248 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-03-09 02:41:39,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-09 02:41:39,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 162. [2025-03-09 02:41:39,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 127 states have (on average 1.141732283464567) internal successors, (145), 125 states have internal predecessors, (145), 20 states have call successors, (20), 6 states have call predecessors, (20), 11 states have return successors, (50), 30 states have call predecessors, (50), 19 states have call successors, (50) [2025-03-09 02:41:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 215 transitions. [2025-03-09 02:41:39,258 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 215 transitions. Word has length 51 [2025-03-09 02:41:39,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:39,259 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 215 transitions. [2025-03-09 02:41:39,259 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-03-09 02:41:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 215 transitions. [2025-03-09 02:41:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 02:41:39,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:39,259 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, 1] [2025-03-09 02:41:39,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 02:41:39,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:39,464 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:39,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash -27100141, now seen corresponding path program 1 times [2025-03-09 02:41:39,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:39,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605201677] [2025-03-09 02:41:39,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:39,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:39,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:41:39,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:41:39,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:39,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 02:41:39,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:39,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605201677] [2025-03-09 02:41:39,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605201677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:39,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313862200] [2025-03-09 02:41:39,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:39,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:39,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:39,516 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:39,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:41:39,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:41:39,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:41:39,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:39,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:39,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:41:39,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:41:39,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:41:39,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313862200] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:39,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:39,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11, 11] total 14 [2025-03-09 02:41:39,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864616500] [2025-03-09 02:41:39,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:39,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 02:41:39,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:39,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 02:41:39,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:41:39,737 INFO L87 Difference]: Start difference. First operand 162 states and 215 transitions. Second operand has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 10 states have internal predecessors, (75), 7 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-09 02:41:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:39,950 INFO L93 Difference]: Finished difference Result 247 states and 324 transitions. [2025-03-09 02:41:39,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:41:39,951 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 10 states have internal predecessors, (75), 7 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 69 [2025-03-09 02:41:39,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:39,952 INFO L225 Difference]: With dead ends: 247 [2025-03-09 02:41:39,952 INFO L226 Difference]: Without dead ends: 181 [2025-03-09 02:41:39,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 122 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:41:39,953 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 89 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:39,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 228 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:41:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-09 02:41:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 170. [2025-03-09 02:41:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 133 states have (on average 1.1353383458646618) internal successors, (151), 131 states have internal predecessors, (151), 21 states have call successors, (21), 7 states have call predecessors, (21), 12 states have return successors, (54), 31 states have call predecessors, (54), 20 states have call successors, (54) [2025-03-09 02:41:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 226 transitions. [2025-03-09 02:41:39,964 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 226 transitions. Word has length 69 [2025-03-09 02:41:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:39,964 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 226 transitions. [2025-03-09 02:41:39,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 10 states have internal predecessors, (75), 7 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-09 02:41:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 226 transitions. [2025-03-09 02:41:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-09 02:41:39,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:39,966 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] [2025-03-09 02:41:39,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:40,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 02:41:40,170 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:40,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:40,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1387055124, now seen corresponding path program 1 times [2025-03-09 02:41:40,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:40,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040970243] [2025-03-09 02:41:40,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:40,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:40,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 02:41:40,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 02:41:40,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:40,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:41:40,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:40,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040970243] [2025-03-09 02:41:40,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040970243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:40,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:40,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:40,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853931888] [2025-03-09 02:41:40,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:40,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:40,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:40,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:40,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:40,218 INFO L87 Difference]: Start difference. First operand 170 states and 226 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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-03-09 02:41:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:40,238 INFO L93 Difference]: Finished difference Result 172 states and 227 transitions. [2025-03-09 02:41:40,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:40,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 54 [2025-03-09 02:41:40,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:40,239 INFO L225 Difference]: With dead ends: 172 [2025-03-09 02:41:40,239 INFO L226 Difference]: Without dead ends: 171 [2025-03-09 02:41:40,240 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-03-09 02:41:40,240 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 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-03-09 02:41:40,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 111 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:40,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-09 02:41:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2025-03-09 02:41:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 133 states have (on average 1.1203007518796992) internal successors, (149), 131 states have internal predecessors, (149), 21 states have call successors, (21), 7 states have call predecessors, (21), 12 states have return successors, (54), 31 states have call predecessors, (54), 20 states have call successors, (54) [2025-03-09 02:41:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 224 transitions. [2025-03-09 02:41:40,265 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 224 transitions. Word has length 54 [2025-03-09 02:41:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:40,265 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 224 transitions. [2025-03-09 02:41:40,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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-03-09 02:41:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 224 transitions. [2025-03-09 02:41:40,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-09 02:41:40,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:40,266 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-03-09 02:41:40,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 02:41:40,266 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:40,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:40,266 INFO L85 PathProgramCache]: Analyzing trace with hash -440515929, now seen corresponding path program 1 times [2025-03-09 02:41:40,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:40,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243907826] [2025-03-09 02:41:40,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:40,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:40,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-09 02:41:40,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 02:41:40,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:40,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-09 02:41:40,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:40,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243907826] [2025-03-09 02:41:40,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243907826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:40,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685151107] [2025-03-09 02:41:40,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:40,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:40,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:40,310 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:40,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 02:41:40,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-09 02:41:40,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 02:41:40,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:40,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:40,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 02:41:40,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:41:40,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:41:40,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685151107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:40,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:41:40,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2025-03-09 02:41:40,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182609982] [2025-03-09 02:41:40,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:40,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:41:40,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:40,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:41:40,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:41:40,456 INFO L87 Difference]: Start difference. First operand 170 states and 224 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 8 states have internal predecessors, (49), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:41:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:40,625 INFO L93 Difference]: Finished difference Result 287 states and 381 transitions. [2025-03-09 02:41:40,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:41:40,626 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 8 states have internal predecessors, (49), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 73 [2025-03-09 02:41:40,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:40,626 INFO L225 Difference]: With dead ends: 287 [2025-03-09 02:41:40,627 INFO L226 Difference]: Without dead ends: 156 [2025-03-09 02:41:40,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:41:40,628 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 109 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:40,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 228 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:40,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-09 02:41:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2025-03-09 02:41:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 120 states have (on average 1.1083333333333334) internal successors, (133), 121 states have internal predecessors, (133), 18 states have call successors, (18), 8 states have call predecessors, (18), 13 states have return successors, (36), 25 states have call predecessors, (36), 17 states have call successors, (36) [2025-03-09 02:41:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 187 transitions. [2025-03-09 02:41:40,636 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 187 transitions. Word has length 73 [2025-03-09 02:41:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:40,636 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 187 transitions. [2025-03-09 02:41:40,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 8 states have internal predecessors, (49), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:41:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 187 transitions. [2025-03-09 02:41:40,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 02:41:40,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:40,637 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-03-09 02:41:40,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 02:41:40,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:40,838 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:40,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:40,838 INFO L85 PathProgramCache]: Analyzing trace with hash 49035892, now seen corresponding path program 1 times [2025-03-09 02:41:40,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:40,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026393560] [2025-03-09 02:41:40,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:40,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:40,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 02:41:40,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 02:41:40,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:40,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:41:40,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:40,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026393560] [2025-03-09 02:41:40,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026393560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:40,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:40,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:40,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110245170] [2025-03-09 02:41:40,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:40,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:40,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:40,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:40,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:40,876 INFO L87 Difference]: Start difference. First operand 155 states and 187 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-03-09 02:41:40,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:40,896 INFO L93 Difference]: Finished difference Result 157 states and 188 transitions. [2025-03-09 02:41:40,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:40,897 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-03-09 02:41:40,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:40,898 INFO L225 Difference]: With dead ends: 157 [2025-03-09 02:41:40,898 INFO L226 Difference]: Without dead ends: 156 [2025-03-09 02:41:40,898 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-03-09 02:41:40,898 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 145 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-03-09 02:41:40,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 145 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-09 02:41:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2025-03-09 02:41:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 120 states have (on average 1.0916666666666666) internal successors, (131), 121 states have internal predecessors, (131), 18 states have call successors, (18), 8 states have call predecessors, (18), 13 states have return successors, (36), 25 states have call predecessors, (36), 17 states have call successors, (36) [2025-03-09 02:41:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 185 transitions. [2025-03-09 02:41:40,919 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 185 transitions. Word has length 55 [2025-03-09 02:41:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:40,921 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 185 transitions. [2025-03-09 02:41:40,921 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-03-09 02:41:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 185 transitions. [2025-03-09 02:41:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-09 02:41:40,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:40,922 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-03-09 02:41:40,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 02:41:40,923 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:40,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:40,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1361290470, now seen corresponding path program 1 times [2025-03-09 02:41:40,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:40,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254350834] [2025-03-09 02:41:40,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:40,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:40,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 02:41:40,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 02:41:40,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:40,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 02:41:41,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:41,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254350834] [2025-03-09 02:41:41,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254350834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:41,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955027913] [2025-03-09 02:41:41,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:41,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:41,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:41,052 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:41,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 02:41:41,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 02:41:41,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 02:41:41,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:41,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:41,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:41:41,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-09 02:41:41,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-09 02:41:41,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955027913] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:41,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:41,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 23 [2025-03-09 02:41:41,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144371409] [2025-03-09 02:41:41,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:41,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 02:41:41,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:41,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 02:41:41,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2025-03-09 02:41:41,353 INFO L87 Difference]: Start difference. First operand 155 states and 185 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-03-09 02:41:41,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:41,891 INFO L93 Difference]: Finished difference Result 273 states and 334 transitions. [2025-03-09 02:41:41,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 02:41:41,892 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-03-09 02:41:41,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:41,893 INFO L225 Difference]: With dead ends: 273 [2025-03-09 02:41:41,893 INFO L226 Difference]: Without dead ends: 169 [2025-03-09 02:41:41,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=1490, Unknown=0, NotChecked=0, Total=1722 [2025-03-09 02:41:41,895 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 106 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:41,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 252 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:41:41,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-09 02:41:41,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2025-03-09 02:41:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 111 states have (on average 1.072072072072072) internal successors, (119), 115 states have internal predecessors, (119), 17 states have call successors, (17), 8 states have call predecessors, (17), 13 states have return successors, (24), 21 states have call predecessors, (24), 16 states have call successors, (24) [2025-03-09 02:41:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 160 transitions. [2025-03-09 02:41:41,904 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 160 transitions. Word has length 68 [2025-03-09 02:41:41,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:41,904 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 160 transitions. [2025-03-09 02:41:41,904 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-03-09 02:41:41,904 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 160 transitions. [2025-03-09 02:41:41,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 02:41:41,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:41,905 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-03-09 02:41:41,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:42,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-09 02:41:42,109 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:42,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:42,109 INFO L85 PathProgramCache]: Analyzing trace with hash -930367833, now seen corresponding path program 1 times [2025-03-09 02:41:42,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:42,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802638395] [2025-03-09 02:41:42,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:42,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:42,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:41:42,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:41:42,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:42,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:41:42,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:42,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802638395] [2025-03-09 02:41:42,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802638395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:42,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126872226] [2025-03-09 02:41:42,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:42,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:42,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:42,240 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:42,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 02:41:42,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:41:42,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:41:42,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:42,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:42,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 02:41:42,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-09 02:41:42,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-09 02:41:42,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126872226] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:42,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:42,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 11] total 28 [2025-03-09 02:41:42,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674208080] [2025-03-09 02:41:42,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:42,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 02:41:42,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:42,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 02:41:42,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2025-03-09 02:41:42,784 INFO L87 Difference]: Start difference. First operand 145 states and 160 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-03-09 02:41:43,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:43,436 INFO L93 Difference]: Finished difference Result 252 states and 277 transitions. [2025-03-09 02:41:43,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-09 02:41:43,438 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-03-09 02:41:43,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:43,439 INFO L225 Difference]: With dead ends: 252 [2025-03-09 02:41:43,439 INFO L226 Difference]: Without dead ends: 119 [2025-03-09 02:41:43,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=360, Invalid=2502, Unknown=0, NotChecked=0, Total=2862 [2025-03-09 02:41:43,441 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 98 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:43,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 284 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:41:43,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-09 02:41:43,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 93. [2025-03-09 02:41:43,446 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, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-09 02:41:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2025-03-09 02:41:43,446 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 69 [2025-03-09 02:41:43,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:43,446 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2025-03-09 02:41:43,447 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-03-09 02:41:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2025-03-09 02:41:43,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-09 02:41:43,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:43,447 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-03-09 02:41:43,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 02:41:43,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 02:41:43,648 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:43,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:43,648 INFO L85 PathProgramCache]: Analyzing trace with hash -978284185, now seen corresponding path program 1 times [2025-03-09 02:41:43,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:43,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585217828] [2025-03-09 02:41:43,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:43,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:43,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-09 02:41:43,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-09 02:41:43,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:43,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-09 02:41:43,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:43,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585217828] [2025-03-09 02:41:43,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585217828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:43,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035765086] [2025-03-09 02:41:43,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:43,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:43,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:43,840 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:43,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 02:41:43,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-09 02:41:43,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-09 02:41:43,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:43,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:43,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 02:41:43,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-09 02:41:44,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-09 02:41:44,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035765086] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:44,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:44,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 15] total 33 [2025-03-09 02:41:44,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439955587] [2025-03-09 02:41:44,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:44,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-09 02:41:44,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:44,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-09 02:41:44,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 02:41:44,419 INFO L87 Difference]: Start difference. First operand 93 states and 99 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-03-09 02:41:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:44,569 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2025-03-09 02:41:44,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 02:41:44,573 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-03-09 02:41:44,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:44,574 INFO L225 Difference]: With dead ends: 127 [2025-03-09 02:41:44,574 INFO L226 Difference]: Without dead ends: 126 [2025-03-09 02:41:44,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=1354, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 02:41:44,574 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:44,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 543 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:44,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-09 02:41:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2025-03-09 02:41:44,581 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, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-09 02:41:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2025-03-09 02:41:44,581 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 83 [2025-03-09 02:41:44,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:44,581 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2025-03-09 02:41:44,582 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-03-09 02:41:44,582 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2025-03-09 02:41:44,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-09 02:41:44,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:44,583 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-03-09 02:41:44,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 02:41:44,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-09 02:41:44,783 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:44,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:44,784 INFO L85 PathProgramCache]: Analyzing trace with hash -262038655, now seen corresponding path program 1 times [2025-03-09 02:41:44,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:44,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609642081] [2025-03-09 02:41:44,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:44,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:44,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-09 02:41:44,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 02:41:44,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:44,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:44,976 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-09 02:41:44,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:44,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609642081] [2025-03-09 02:41:44,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609642081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:44,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693149407] [2025-03-09 02:41:44,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:44,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:44,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:44,979 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:44,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 02:41:45,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-09 02:41:45,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 02:41:45,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:45,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:45,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 02:41:45,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-09 02:41:45,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-09 02:41:45,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693149407] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:45,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:45,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 16] total 33 [2025-03-09 02:41:45,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272726065] [2025-03-09 02:41:45,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:45,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-09 02:41:45,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:45,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-09 02:41:45,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 02:41:45,496 INFO L87 Difference]: Start difference. First operand 92 states and 98 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-03-09 02:41:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:45,603 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2025-03-09 02:41:45,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 02:41:45,604 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-03-09 02:41:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:45,604 INFO L225 Difference]: With dead ends: 121 [2025-03-09 02:41:45,604 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:41:45,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 145 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=1090, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 02:41:45,606 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:45,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 429 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:41:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:41:45,606 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-03-09 02:41:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:41:45,607 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2025-03-09 02:41:45,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:45,607 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:41:45,607 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-03-09 02:41:45,607 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:41:45,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:41:45,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-09 02:41:45,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-09 02:41:45,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-09 02:41:45,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-09 02:41:45,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-09 02:41:45,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-09 02:41:45,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-09 02:41:45,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-09 02:41:45,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-09 02:41:45,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-09 02:41:45,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-09 02:41:45,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-09 02:41:45,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:45,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 02:41:45,818 INFO L422 BasicCegarLoop]: Path program histogram: [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-03-09 02:41:45,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:41:46,708 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:41:46,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:41:46 BoogieIcfgContainer [2025-03-09 02:41:46,712 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:41:46,712 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:41:46,712 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:41:46,712 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:41:46,713 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:41:33" (3/4) ... [2025-03-09 02:41:46,714 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:41:46,718 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibo2 [2025-03-09 02:41:46,719 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibo1 [2025-03-09 02:41:46,721 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 02:41:46,721 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:41:46,721 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:41:46,721 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:41:46,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:41:46,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:41:46,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:41:46,772 INFO L158 Benchmark]: Toolchain (without parser) took 13589.89ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 112.7MB in the beginning and 153.8MB in the end (delta: -41.1MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2025-03-09 02:41:46,772 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:41:46,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 141.47ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 102.1MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:41:46,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.77ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 101.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:41:46,772 INFO L158 Benchmark]: Boogie Preprocessor took 29.51ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:41:46,772 INFO L158 Benchmark]: IcfgBuilder took 218.76ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 88.1MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:41:46,772 INFO L158 Benchmark]: TraceAbstraction took 13114.44ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 87.6MB in the beginning and 159.7MB in the end (delta: -72.1MB). Peak memory consumption was 98.8MB. Max. memory is 16.1GB. [2025-03-09 02:41:46,773 INFO L158 Benchmark]: Witness Printer took 59.37ms. Allocated memory is still 218.1MB. Free memory was 159.7MB in the beginning and 153.8MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:41:46,773 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.14ms. Allocated memory is still 226.5MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 141.47ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 102.1MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.77ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 101.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.51ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 218.76ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 88.1MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13114.44ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 87.6MB in the beginning and 159.7MB in the end (delta: -72.1MB). Peak memory consumption was 98.8MB. Max. memory is 16.1GB. * Witness Printer took 59.37ms. Allocated memory is still 218.1MB. Free memory was 159.7MB in the beginning and 153.8MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 65 edges, 12 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 987 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 949 mSDsluCounter, 5550 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4667 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4631 IncrementalHoareTripleChecker+Invalid, 4900 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 883 mSDtfsCounter, 4631 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1581 GetRequests, 1191 SyntacticMatches, 48 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=17, InterpolantAutomatonStates: 260, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 238 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1802 NumberOfCodeBlocks, 1802 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2347 ConstructedInterpolants, 0 QuantifiedInterpolants, 4956 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1625 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 47 InterpolantComputations, 14 PerfectInterpolantSequences, 1340/1716 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-03-09 02:41:46,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE