./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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_5-2.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 eb57cc67b4a5d1052a722feccb00a81098424cf4bc0bbd7bfe756405ab740d43 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:29:00,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:29:00,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:29:00,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:29:00,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:29:00,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:29:00,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:29:00,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:29:00,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:29:00,685 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:29:00,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:29:00,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:29:00,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:29:00,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:29:00,686 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:29:00,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:29:00,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:29:00,687 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:29:00,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:29:00,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:29:00,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:29:00,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:29:00,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:29:00,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:29:00,688 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:29:00,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:29:00,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:29:00,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:29:00,689 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 -> eb57cc67b4a5d1052a722feccb00a81098424cf4bc0bbd7bfe756405ab740d43 [2025-03-04 11:29:00,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:29:00,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:29:00,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:29:00,912 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:29:00,913 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:29:00,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c [2025-03-04 11:29:02,012 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e1b5c7db/b27f4b6977d743f9b1fb01e8d8d28db5/FLAG3982205d2 [2025-03-04 11:29:02,195 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:29:02,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c [2025-03-04 11:29:02,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e1b5c7db/b27f4b6977d743f9b1fb01e8d8d28db5/FLAG3982205d2 [2025-03-04 11:29:02,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e1b5c7db/b27f4b6977d743f9b1fb01e8d8d28db5 [2025-03-04 11:29:02,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:29:02,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:29:02,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:29:02,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:29:02,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:29:02,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d6146f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02, skipping insertion in model container [2025-03-04 11:29:02,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:29:02,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:29:02,370 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:29:02,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:29:02,390 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:29:02,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02 WrapperNode [2025-03-04 11:29:02,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:29:02,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:29:02,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:29:02,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:29:02,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,412 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2025-03-04 11:29:02,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:29:02,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:29:02,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:29:02,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:29:02,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,429 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-04 11:29:02,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,432 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:29:02,436 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:29:02,437 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:29:02,437 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:29:02,438 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (1/1) ... [2025-03-04 11:29:02,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:29:02,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:02,464 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-04 11:29:02,470 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-04 11:29:02,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:29:02,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:29:02,485 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2025-03-04 11:29:02,485 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2025-03-04 11:29:02,485 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2025-03-04 11:29:02,485 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2025-03-04 11:29:02,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:29:02,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:29:02,532 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:29:02,533 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:29:02,625 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~ret6;havoc #t~ret7; [2025-03-04 11:29:02,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: havoc #t~ret4;havoc #t~ret5; [2025-03-04 11:29:02,669 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-04 11:29:02,669 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:29:02,682 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:29:02,684 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:29:02,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:29:02 BoogieIcfgContainer [2025-03-04 11:29:02,685 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:29:02,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:29:02,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:29:02,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:29:02,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:29:02" (1/3) ... [2025-03-04 11:29:02,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359080d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:29:02, skipping insertion in model container [2025-03-04 11:29:02,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:02" (2/3) ... [2025-03-04 11:29:02,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359080d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:29:02, skipping insertion in model container [2025-03-04 11:29:02,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:29:02" (3/3) ... [2025-03-04 11:29:02,695 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-2.c [2025-03-04 11:29:02,707 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:29:02,709 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_2calls_5-2.c that has 3 procedures, 53 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-04 11:29:02,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:29:02,775 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;@135c1bd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:29:02,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-04 11:29:02,778 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-04 11:29:02,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:29:02,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:02,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:02,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:02,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:02,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1954105288, now seen corresponding path program 1 times [2025-03-04 11:29:02,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:02,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225975919] [2025-03-04 11:29:02,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:02,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:02,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:29:02,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:29:02,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:02,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:02,889 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-04 11:29:02,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:02,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225975919] [2025-03-04 11:29:02,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225975919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:02,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:02,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:29:02,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271468548] [2025-03-04 11:29:02,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:02,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:29:02,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:02,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:29:02,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:29:02,917 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-04 11:29:02,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:02,949 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-03-04 11:29:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:29:02,950 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-04 11:29:02,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:02,955 INFO L225 Difference]: With dead ends: 59 [2025-03-04 11:29:02,955 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 11:29:02,957 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-04 11:29:02,959 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-04 11:29:02,959 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-04 11:29:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 11:29:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-03-04 11:29:02,983 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-04 11:29:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-04 11:29:02,987 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 7 [2025-03-04 11:29:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:02,987 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-04 11:29:02,987 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-04 11:29:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-03-04 11:29:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:29:02,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:02,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:02,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:29:02,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:02,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:02,989 INFO L85 PathProgramCache]: Analyzing trace with hash -447721764, now seen corresponding path program 1 times [2025-03-04 11:29:02,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:02,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859391511] [2025-03-04 11:29:02,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:02,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:02,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:29:02,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:29:02,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:02,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:03,047 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-04 11:29:03,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859391511] [2025-03-04 11:29:03,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859391511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:03,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:03,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:03,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459039647] [2025-03-04 11:29:03,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:03,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:03,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:03,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:03,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:03,048 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-04 11:29:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:03,113 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2025-03-04 11:29:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:03,114 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-04 11:29:03,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:03,115 INFO L225 Difference]: With dead ends: 64 [2025-03-04 11:29:03,115 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 11:29:03,115 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-04 11:29:03,116 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-04 11:29:03,116 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-04 11:29:03,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 11:29:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-03-04 11:29:03,124 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-04 11:29:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2025-03-04 11:29:03,126 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 8 [2025-03-04 11:29:03,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:03,126 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2025-03-04 11:29:03,127 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-04 11:29:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2025-03-04 11:29:03,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 11:29:03,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:03,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:03,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:29:03,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibo2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:03,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:03,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2145956475, now seen corresponding path program 1 times [2025-03-04 11:29:03,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:03,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788808978] [2025-03-04 11:29:03,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:03,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:03,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 11:29:03,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 11:29:03,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:03,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:03,163 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-04 11:29:03,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:03,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788808978] [2025-03-04 11:29:03,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788808978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:03,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:03,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:29:03,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984494221] [2025-03-04 11:29:03,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:03,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:29:03,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:03,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:29:03,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:29:03,164 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-04 11:29:03,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:03,184 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2025-03-04 11:29:03,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:29:03,184 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-04 11:29:03,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:03,185 INFO L225 Difference]: With dead ends: 58 [2025-03-04 11:29:03,185 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 11:29:03,185 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-04 11:29:03,186 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-04 11:29:03,186 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-04 11:29:03,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 11:29:03,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-03-04 11:29:03,195 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-04 11:29:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-03-04 11:29:03,197 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 13 [2025-03-04 11:29:03,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:03,197 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-03-04 11:29:03,197 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-04 11:29:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-03-04 11:29:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 11:29:03,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:03,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:03,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:29:03,198 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:03,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:03,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2100141288, now seen corresponding path program 1 times [2025-03-04 11:29:03,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:03,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74933484] [2025-03-04 11:29:03,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:03,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:03,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:29:03,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:29:03,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:03,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:03,293 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-04 11:29:03,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:03,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74933484] [2025-03-04 11:29:03,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74933484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:03,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:03,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:29:03,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260971601] [2025-03-04 11:29:03,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:03,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:29:03,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:03,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:29:03,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:29:03,295 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-04 11:29:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:03,396 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2025-03-04 11:29:03,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:29:03,397 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-04 11:29:03,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:03,397 INFO L225 Difference]: With dead ends: 58 [2025-03-04 11:29:03,397 INFO L226 Difference]: Without dead ends: 54 [2025-03-04 11:29:03,398 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-04 11:29:03,398 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-04 11:29:03,398 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-04 11:29:03,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-04 11:29:03,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2025-03-04 11:29:03,409 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-04 11:29:03,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-03-04 11:29:03,412 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 14 [2025-03-04 11:29:03,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:03,412 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-03-04 11:29:03,412 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-04 11:29:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-03-04 11:29:03,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 11:29:03,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:03,413 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-04 11:29:03,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:29:03,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:03,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:03,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1831817774, now seen corresponding path program 1 times [2025-03-04 11:29:03,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:03,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801929877] [2025-03-04 11:29:03,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:03,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:03,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 11:29:03,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 11:29:03,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:03,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:03,529 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-04 11:29:03,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:03,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801929877] [2025-03-04 11:29:03,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801929877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:03,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:03,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:03,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635501478] [2025-03-04 11:29:03,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:03,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:03,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:03,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:03,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:03,531 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-04 11:29:03,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:03,559 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2025-03-04 11:29:03,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:03,559 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-04 11:29:03,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:03,560 INFO L225 Difference]: With dead ends: 74 [2025-03-04 11:29:03,560 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 11:29:03,561 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-04 11:29:03,561 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-04 11:29:03,561 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-04 11:29:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 11:29:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-03-04 11:29:03,572 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-04 11:29:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2025-03-04 11:29:03,573 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 23 [2025-03-04 11:29:03,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:03,576 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2025-03-04 11:29:03,576 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-04 11:29:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2025-03-04 11:29:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:29:03,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:03,577 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-04 11:29:03,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:29:03,578 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:03,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:03,578 INFO L85 PathProgramCache]: Analyzing trace with hash -631666365, now seen corresponding path program 1 times [2025-03-04 11:29:03,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:03,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488569898] [2025-03-04 11:29:03,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:03,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:03,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:29:03,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:29:03,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:03,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:03,645 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-04 11:29:03,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:03,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488569898] [2025-03-04 11:29:03,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488569898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:03,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617101031] [2025-03-04 11:29:03,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:03,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:03,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:03,648 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-04 11:29:03,649 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-04 11:29:03,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:29:03,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:29:03,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:03,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:03,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:29:03,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:03,752 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-04 11:29:03,752 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:29:03,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617101031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:03,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:29:03,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2025-03-04 11:29:03,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154133110] [2025-03-04 11:29:03,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:03,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:29:03,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:03,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:29:03,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:29:03,756 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-04 11:29:03,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:03,856 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2025-03-04 11:29:03,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:29:03,857 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-04 11:29:03,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:03,857 INFO L225 Difference]: With dead ends: 117 [2025-03-04 11:29:03,857 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 11:29:03,858 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-04 11:29:03,858 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-04 11:29:03,858 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-04 11:29:03,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 11:29:03,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-03-04 11:29:03,867 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-04 11:29:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2025-03-04 11:29:03,869 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 24 [2025-03-04 11:29:03,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:03,869 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2025-03-04 11:29:03,869 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-04 11:29:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2025-03-04 11:29:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:29:03,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:03,870 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-04 11:29:03,875 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-04 11:29:04,071 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-04 11:29:04,071 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:04,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:04,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2003454357, now seen corresponding path program 1 times [2025-03-04 11:29:04,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:04,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636629841] [2025-03-04 11:29:04,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:04,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:04,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:29:04,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:29:04,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:04,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:04,136 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-04 11:29:04,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:04,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636629841] [2025-03-04 11:29:04,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636629841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:04,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:04,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:04,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862830757] [2025-03-04 11:29:04,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:04,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:04,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:04,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:04,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:04,137 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-04 11:29:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:04,174 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2025-03-04 11:29:04,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:04,174 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-04 11:29:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:04,175 INFO L225 Difference]: With dead ends: 75 [2025-03-04 11:29:04,175 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 11:29:04,175 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-04 11:29:04,176 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-04 11:29:04,176 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-04 11:29:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 11:29:04,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2025-03-04 11:29:04,181 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-04 11:29:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2025-03-04 11:29:04,182 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 29 [2025-03-04 11:29:04,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:04,182 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2025-03-04 11:29:04,182 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-04 11:29:04,182 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2025-03-04 11:29:04,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 11:29:04,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:04,182 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-04 11:29:04,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:29:04,183 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:04,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:04,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1424432597, now seen corresponding path program 1 times [2025-03-04 11:29:04,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:04,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13554132] [2025-03-04 11:29:04,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:04,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:04,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:29:04,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:29:04,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:04,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:04,250 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-04 11:29:04,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:04,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13554132] [2025-03-04 11:29:04,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13554132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:04,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993105384] [2025-03-04 11:29:04,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:04,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:04,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:04,252 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-04 11:29:04,254 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-04 11:29:04,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:29:04,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:29:04,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:04,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:04,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:29:04,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:04,389 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-04 11:29:04,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:04,523 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-04 11:29:04,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993105384] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:04,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:04,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-04 11:29:04,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558918621] [2025-03-04 11:29:04,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:04,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:29:04,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:04,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:29:04,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:29:04,524 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-04 11:29:04,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:04,879 INFO L93 Difference]: Finished difference Result 192 states and 253 transitions. [2025-03-04 11:29:04,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:29:04,880 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-04 11:29:04,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:04,881 INFO L225 Difference]: With dead ends: 192 [2025-03-04 11:29:04,881 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 11:29:04,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:29:04,884 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 122 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:04,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 651 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:29:04,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 11:29:04,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 115. [2025-03-04 11:29:04,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 92 states have internal predecessors, (103), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (28), 16 states have call predecessors, (28), 14 states have call successors, (28) [2025-03-04 11:29:04,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 146 transitions. [2025-03-04 11:29:04,897 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 146 transitions. Word has length 30 [2025-03-04 11:29:04,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:04,897 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 146 transitions. [2025-03-04 11:29:04,897 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-04 11:29:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2025-03-04 11:29:04,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 11:29:04,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:04,898 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2025-03-04 11:29:04,904 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-04 11:29:05,102 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-04 11:29:05,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:05,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:05,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2119279126, now seen corresponding path program 2 times [2025-03-04 11:29:05,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:05,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173763850] [2025-03-04 11:29:05,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:05,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:05,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 11:29:05,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:29:05,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:05,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:29:05,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:05,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173763850] [2025-03-04 11:29:05,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173763850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:05,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314484176] [2025-03-04 11:29:05,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:05,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:05,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:05,194 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-04 11:29:05,195 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-04 11:29:05,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 11:29:05,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:29:05,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:05,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:05,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:29:05,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:29:05,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:29:05,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314484176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:05,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:29:05,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-04 11:29:05,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097050405] [2025-03-04 11:29:05,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:05,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:05,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:05,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:05,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:29:05,267 INFO L87 Difference]: Start difference. First operand 115 states and 146 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:05,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:05,291 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2025-03-04 11:29:05,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:05,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-03-04 11:29:05,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:05,293 INFO L225 Difference]: With dead ends: 127 [2025-03-04 11:29:05,293 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 11:29:05,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:29:05,294 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:05,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 140 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 11:29:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2025-03-04 11:29:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 95 states have internal predecessors, (109), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (28), 19 states have call predecessors, (28), 14 states have call successors, (28) [2025-03-04 11:29:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 152 transitions. [2025-03-04 11:29:05,307 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 152 transitions. Word has length 42 [2025-03-04 11:29:05,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:05,307 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 152 transitions. [2025-03-04 11:29:05,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:05,310 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 152 transitions. [2025-03-04 11:29:05,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 11:29:05,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:05,310 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2025-03-04 11:29:05,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:05,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:05,512 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:05,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:05,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1273143481, now seen corresponding path program 1 times [2025-03-04 11:29:05,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:05,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492684742] [2025-03-04 11:29:05,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:05,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:05,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:29:05,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:29:05,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:05,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:05,577 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:29:05,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:05,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492684742] [2025-03-04 11:29:05,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492684742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:05,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816912304] [2025-03-04 11:29:05,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:05,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:05,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:05,581 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-04 11:29:05,583 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-04 11:29:05,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:29:05,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:29:05,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:05,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:05,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:29:05,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:29:05,672 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:29:05,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816912304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:05,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:29:05,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 11:29:05,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420455584] [2025-03-04 11:29:05,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:05,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:29:05,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:05,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:29:05,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:29:05,675 INFO L87 Difference]: Start difference. First operand 121 states and 152 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:05,706 INFO L93 Difference]: Finished difference Result 149 states and 191 transitions. [2025-03-04 11:29:05,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:29:05,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-03-04 11:29:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:05,708 INFO L225 Difference]: With dead ends: 149 [2025-03-04 11:29:05,708 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 11:29:05,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:29:05,709 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:05,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 114 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 11:29:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 132. [2025-03-04 11:29:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 103 states have (on average 1.145631067961165) internal successors, (118), 103 states have internal predecessors, (118), 17 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (34), 22 states have call predecessors, (34), 16 states have call successors, (34) [2025-03-04 11:29:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 169 transitions. [2025-03-04 11:29:05,719 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 169 transitions. Word has length 43 [2025-03-04 11:29:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:05,719 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 169 transitions. [2025-03-04 11:29:05,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 169 transitions. [2025-03-04 11:29:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 11:29:05,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:05,720 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:05,727 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-04 11:29:05,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:05,921 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:05,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:05,921 INFO L85 PathProgramCache]: Analyzing trace with hash -846190875, now seen corresponding path program 1 times [2025-03-04 11:29:05,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:05,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295606310] [2025-03-04 11:29:05,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:05,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:05,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 11:29:05,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:29:05,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:05,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 11:29:05,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:05,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295606310] [2025-03-04 11:29:05,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295606310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:05,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:05,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:05,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080383986] [2025-03-04 11:29:05,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:05,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:05,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:05,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:05,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:05,967 INFO L87 Difference]: Start difference. First operand 132 states and 169 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-04 11:29:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:05,996 INFO L93 Difference]: Finished difference Result 148 states and 190 transitions. [2025-03-04 11:29:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:05,996 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 44 [2025-03-04 11:29:05,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:05,997 INFO L225 Difference]: With dead ends: 148 [2025-03-04 11:29:05,997 INFO L226 Difference]: Without dead ends: 147 [2025-03-04 11:29:05,997 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-04 11:29:05,998 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:05,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 154 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-04 11:29:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 128. [2025-03-04 11:29:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 100 states have (on average 1.15) internal successors, (115), 100 states have internal predecessors, (115), 16 states have call successors, (16), 6 states have call predecessors, (16), 8 states have return successors, (31), 21 states have call predecessors, (31), 15 states have call successors, (31) [2025-03-04 11:29:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 162 transitions. [2025-03-04 11:29:06,010 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 162 transitions. Word has length 44 [2025-03-04 11:29:06,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:06,011 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 162 transitions. [2025-03-04 11:29:06,011 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-04 11:29:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 162 transitions. [2025-03-04 11:29:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 11:29:06,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:06,012 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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-04 11:29:06,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:29:06,012 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:06,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:06,013 INFO L85 PathProgramCache]: Analyzing trace with hash -630583103, now seen corresponding path program 1 times [2025-03-04 11:29:06,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:06,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648661428] [2025-03-04 11:29:06,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:06,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:06,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:29:06,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:29:06,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:06,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 11:29:06,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:06,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648661428] [2025-03-04 11:29:06,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648661428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:06,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810762892] [2025-03-04 11:29:06,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:06,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:06,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:06,085 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-04 11:29:06,086 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-04 11:29:06,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:29:06,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:29:06,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:06,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:06,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:29:06,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:06,264 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:29:06,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:29:06,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810762892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:06,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:06,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 13] total 17 [2025-03-04 11:29:06,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070261318] [2025-03-04 11:29:06,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:06,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 11:29:06,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:06,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 11:29:06,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:29:06,388 INFO L87 Difference]: Start difference. First operand 128 states and 162 transitions. Second operand has 17 states, 16 states have (on average 4.25) internal successors, (68), 12 states have internal predecessors, (68), 8 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 11:29:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:06,718 INFO L93 Difference]: Finished difference Result 274 states and 368 transitions. [2025-03-04 11:29:06,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:29:06,718 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.25) internal successors, (68), 12 states have internal predecessors, (68), 8 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 57 [2025-03-04 11:29:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:06,719 INFO L225 Difference]: With dead ends: 274 [2025-03-04 11:29:06,719 INFO L226 Difference]: Without dead ends: 167 [2025-03-04 11:29:06,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 95 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:29:06,721 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 116 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:06,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 292 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:29:06,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-04 11:29:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 154. [2025-03-04 11:29:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 120 states have (on average 1.125) internal successors, (135), 121 states have internal predecessors, (135), 19 states have call successors, (19), 8 states have call predecessors, (19), 11 states have return successors, (35), 24 states have call predecessors, (35), 18 states have call successors, (35) [2025-03-04 11:29:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 189 transitions. [2025-03-04 11:29:06,730 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 189 transitions. Word has length 57 [2025-03-04 11:29:06,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:06,731 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 189 transitions. [2025-03-04 11:29:06,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.25) internal successors, (68), 12 states have internal predecessors, (68), 8 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 11:29:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 189 transitions. [2025-03-04 11:29:06,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 11:29:06,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:06,731 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:06,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:06,932 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,SelfDestructingSolverStorable11 [2025-03-04 11:29:06,932 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:06,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:06,932 INFO L85 PathProgramCache]: Analyzing trace with hash 612165549, now seen corresponding path program 1 times [2025-03-04 11:29:06,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:06,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617757344] [2025-03-04 11:29:06,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:06,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:06,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 11:29:06,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:29:06,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:06,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:29:07,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:07,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617757344] [2025-03-04 11:29:07,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617757344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:07,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676636247] [2025-03-04 11:29:07,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:07,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:07,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:07,003 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-04 11:29:07,005 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-04 11:29:07,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 11:29:07,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:29:07,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:07,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:07,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:29:07,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:29:07,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:29:07,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676636247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:07,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:07,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 15, 15] total 31 [2025-03-04 11:29:07,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487635018] [2025-03-04 11:29:07,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:07,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 11:29:07,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:07,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 11:29:07,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2025-03-04 11:29:07,448 INFO L87 Difference]: Start difference. First operand 154 states and 189 transitions. Second operand has 31 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 21 states have internal predecessors, (89), 14 states have call successors, (18), 11 states have call predecessors, (18), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:29:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:07,981 INFO L93 Difference]: Finished difference Result 307 states and 389 transitions. [2025-03-04 11:29:07,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:29:07,982 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 21 states have internal predecessors, (89), 14 states have call successors, (18), 11 states have call predecessors, (18), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2025-03-04 11:29:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:07,983 INFO L225 Difference]: With dead ends: 307 [2025-03-04 11:29:07,983 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 11:29:07,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=1700, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 11:29:07,984 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 253 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:07,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 446 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:29:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 11:29:07,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 171. [2025-03-04 11:29:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.1203007518796992) internal successors, (149), 135 states have internal predecessors, (149), 21 states have call successors, (21), 9 states have call predecessors, (21), 13 states have return successors, (33), 26 states have call predecessors, (33), 20 states have call successors, (33) [2025-03-04 11:29:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 203 transitions. [2025-03-04 11:29:07,993 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 203 transitions. Word has length 48 [2025-03-04 11:29:07,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:07,993 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 203 transitions. [2025-03-04 11:29:07,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 21 states have internal predecessors, (89), 14 states have call successors, (18), 11 states have call predecessors, (18), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:29:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 203 transitions. [2025-03-04 11:29:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 11:29:07,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:07,994 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:08,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:08,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:08,195 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:08,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:08,196 INFO L85 PathProgramCache]: Analyzing trace with hash 78284898, now seen corresponding path program 1 times [2025-03-04 11:29:08,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:08,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186422006] [2025-03-04 11:29:08,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:08,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:08,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 11:29:08,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:29:08,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:08,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:08,249 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 11:29:08,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:08,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186422006] [2025-03-04 11:29:08,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186422006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:08,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:08,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:08,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486502551] [2025-03-04 11:29:08,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:08,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:08,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:08,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:08,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:08,251 INFO L87 Difference]: Start difference. First operand 171 states and 203 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-04 11:29:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:08,276 INFO L93 Difference]: Finished difference Result 176 states and 209 transitions. [2025-03-04 11:29:08,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:08,277 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-04 11:29:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:08,279 INFO L225 Difference]: With dead ends: 176 [2025-03-04 11:29:08,280 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 11:29:08,280 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-04 11:29:08,280 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:08,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 140 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:08,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 11:29:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2025-03-04 11:29:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 135 states have (on average 1.1111111111111112) internal successors, (150), 136 states have internal predecessors, (150), 21 states have call successors, (21), 9 states have call predecessors, (21), 13 states have return successors, (33), 27 states have call predecessors, (33), 20 states have call successors, (33) [2025-03-04 11:29:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2025-03-04 11:29:08,290 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 55 [2025-03-04 11:29:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:08,291 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2025-03-04 11:29:08,291 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-04 11:29:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2025-03-04 11:29:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:29:08,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:08,292 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] [2025-03-04 11:29:08,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:29:08,292 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:08,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:08,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1315847725, now seen corresponding path program 1 times [2025-03-04 11:29:08,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:08,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865959318] [2025-03-04 11:29:08,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:08,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:08,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:29:08,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:29:08,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:08,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 11:29:08,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:08,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865959318] [2025-03-04 11:29:08,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865959318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:08,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:08,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:08,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827620500] [2025-03-04 11:29:08,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:08,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:08,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:08,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:08,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:08,341 INFO L87 Difference]: Start difference. First operand 173 states and 204 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-04 11:29:08,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:08,365 INFO L93 Difference]: Finished difference Result 178 states and 210 transitions. [2025-03-04 11:29:08,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:08,366 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 56 [2025-03-04 11:29:08,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:08,367 INFO L225 Difference]: With dead ends: 178 [2025-03-04 11:29:08,368 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 11:29:08,368 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-04 11:29:08,368 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:08,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 117 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 11:29:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2025-03-04 11:29:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 135 states have (on average 1.1111111111111112) internal successors, (150), 136 states have internal predecessors, (150), 21 states have call successors, (21), 9 states have call predecessors, (21), 13 states have return successors, (33), 27 states have call predecessors, (33), 20 states have call successors, (33) [2025-03-04 11:29:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2025-03-04 11:29:08,381 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 56 [2025-03-04 11:29:08,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:08,381 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2025-03-04 11:29:08,382 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-04 11:29:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2025-03-04 11:29:08,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:29:08,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:08,382 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:08,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 11:29:08,383 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:08,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:08,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1868135450, now seen corresponding path program 1 times [2025-03-04 11:29:08,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:08,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314573877] [2025-03-04 11:29:08,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:08,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:08,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:29:08,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:29:08,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:08,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 11:29:08,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:08,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314573877] [2025-03-04 11:29:08,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314573877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:08,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:08,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:08,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774135791] [2025-03-04 11:29:08,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:08,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:08,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:08,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:08,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:08,430 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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-04 11:29:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:08,474 INFO L93 Difference]: Finished difference Result 178 states and 209 transitions. [2025-03-04 11:29:08,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:08,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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 56 [2025-03-04 11:29:08,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:08,476 INFO L225 Difference]: With dead ends: 178 [2025-03-04 11:29:08,476 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 11:29:08,477 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-04 11:29:08,477 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:08,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 140 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 11:29:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 169. [2025-03-04 11:29:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 132 states have (on average 1.106060606060606) internal successors, (146), 133 states have internal predecessors, (146), 20 states have call successors, (20), 9 states have call predecessors, (20), 13 states have return successors, (32), 26 states have call predecessors, (32), 19 states have call successors, (32) [2025-03-04 11:29:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2025-03-04 11:29:08,487 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 56 [2025-03-04 11:29:08,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:08,487 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2025-03-04 11:29:08,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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-04 11:29:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2025-03-04 11:29:08,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 11:29:08,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:08,489 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-04 11:29:08,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 11:29:08,489 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:08,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:08,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2136573803, now seen corresponding path program 1 times [2025-03-04 11:29:08,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:08,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643319442] [2025-03-04 11:29:08,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:08,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:08,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:29:08,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:29:08,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:08,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 11:29:08,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:08,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643319442] [2025-03-04 11:29:08,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643319442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:08,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214458404] [2025-03-04 11:29:08,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:08,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:08,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:08,604 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-04 11:29:08,605 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-04 11:29:08,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:29:08,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:29:08,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:08,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:08,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:29:08,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:08,719 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 11:29:08,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:29:08,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214458404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:08,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:29:08,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2025-03-04 11:29:08,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123317673] [2025-03-04 11:29:08,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:08,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:29:08,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:08,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:29:08,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:29:08,720 INFO L87 Difference]: Start difference. First operand 169 states and 198 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-04 11:29:08,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:08,781 INFO L93 Difference]: Finished difference Result 204 states and 244 transitions. [2025-03-04 11:29:08,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:29:08,781 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 57 [2025-03-04 11:29:08,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:08,782 INFO L225 Difference]: With dead ends: 204 [2025-03-04 11:29:08,782 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 11:29:08,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 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-04 11:29:08,783 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:08,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 241 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:08,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 11:29:08,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 179. [2025-03-04 11:29:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.1079136690647482) internal successors, (154), 141 states have internal predecessors, (154), 21 states have call successors, (21), 9 states have call predecessors, (21), 15 states have return successors, (39), 28 states have call predecessors, (39), 20 states have call successors, (39) [2025-03-04 11:29:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 214 transitions. [2025-03-04 11:29:08,791 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 214 transitions. Word has length 57 [2025-03-04 11:29:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:08,791 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 214 transitions. [2025-03-04 11:29:08,791 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-04 11:29:08,792 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 214 transitions. [2025-03-04 11:29:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 11:29:08,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:08,792 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:08,798 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-04 11:29:08,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:08,993 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:08,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:08,993 INFO L85 PathProgramCache]: Analyzing trace with hash -819029127, now seen corresponding path program 1 times [2025-03-04 11:29:08,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:08,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580945885] [2025-03-04 11:29:08,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:08,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:08,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 11:29:08,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 11:29:08,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:08,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 11:29:09,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:09,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580945885] [2025-03-04 11:29:09,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580945885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:09,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:09,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:09,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071298912] [2025-03-04 11:29:09,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:09,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:09,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:09,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:09,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:09,036 INFO L87 Difference]: Start difference. First operand 179 states and 214 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-04 11:29:09,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:09,057 INFO L93 Difference]: Finished difference Result 187 states and 222 transitions. [2025-03-04 11:29:09,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:09,058 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 61 [2025-03-04 11:29:09,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:09,059 INFO L225 Difference]: With dead ends: 187 [2025-03-04 11:29:09,059 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 11:29:09,059 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-04 11:29:09,059 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:09,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 111 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:09,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 11:29:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 179. [2025-03-04 11:29:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.0935251798561152) internal successors, (152), 141 states have internal predecessors, (152), 21 states have call successors, (21), 9 states have call predecessors, (21), 15 states have return successors, (39), 28 states have call predecessors, (39), 20 states have call successors, (39) [2025-03-04 11:29:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 212 transitions. [2025-03-04 11:29:09,069 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 212 transitions. Word has length 61 [2025-03-04 11:29:09,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:09,070 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 212 transitions. [2025-03-04 11:29:09,070 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-04 11:29:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 212 transitions. [2025-03-04 11:29:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 11:29:09,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:09,071 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 11:29:09,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 11:29:09,071 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:09,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:09,071 INFO L85 PathProgramCache]: Analyzing trace with hash 865568913, now seen corresponding path program 1 times [2025-03-04 11:29:09,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:09,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74250658] [2025-03-04 11:29:09,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:09,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:09,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 11:29:09,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 11:29:09,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:09,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 11:29:09,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:09,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74250658] [2025-03-04 11:29:09,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74250658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:09,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912530909] [2025-03-04 11:29:09,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:09,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:09,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:09,211 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-04 11:29:09,212 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-04 11:29:09,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 11:29:09,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 11:29:09,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:09,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:09,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:29:09,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 11:29:09,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 11:29:09,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912530909] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:09,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:09,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 25 [2025-03-04 11:29:09,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515414845] [2025-03-04 11:29:09,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:09,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 11:29:09,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:09,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 11:29:09,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2025-03-04 11:29:09,514 INFO L87 Difference]: Start difference. First operand 179 states and 212 transitions. Second operand has 25 states, 24 states have (on average 3.5) internal successors, (84), 22 states have internal predecessors, (84), 10 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 11:29:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:10,103 INFO L93 Difference]: Finished difference Result 332 states and 390 transitions. [2025-03-04 11:29:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 11:29:10,104 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 22 states have internal predecessors, (84), 10 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) Word has length 74 [2025-03-04 11:29:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:10,105 INFO L225 Difference]: With dead ends: 332 [2025-03-04 11:29:10,105 INFO L226 Difference]: Without dead ends: 210 [2025-03-04 11:29:10,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=271, Invalid=1799, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 11:29:10,106 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 132 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:10,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 291 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:29:10,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-04 11:29:10,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 166. [2025-03-04 11:29:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 128 states have (on average 1.0859375) internal successors, (139), 132 states have internal predecessors, (139), 20 states have call successors, (20), 9 states have call predecessors, (20), 14 states have return successors, (33), 24 states have call predecessors, (33), 19 states have call successors, (33) [2025-03-04 11:29:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 192 transitions. [2025-03-04 11:29:10,113 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 192 transitions. Word has length 74 [2025-03-04 11:29:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:10,113 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 192 transitions. [2025-03-04 11:29:10,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 22 states have internal predecessors, (84), 10 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 11:29:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2025-03-04 11:29:10,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 11:29:10,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:10,114 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 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-04 11:29:10,124 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-04 11:29:10,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:10,319 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:10,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:10,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1573359769, now seen corresponding path program 1 times [2025-03-04 11:29:10,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:10,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49895653] [2025-03-04 11:29:10,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:10,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:10,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 11:29:10,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 11:29:10,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:10,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 11:29:10,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:10,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49895653] [2025-03-04 11:29:10,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49895653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:10,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496200865] [2025-03-04 11:29:10,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:10,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:10,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:10,426 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-04 11:29:10,428 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-04 11:29:10,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 11:29:10,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 11:29:10,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:10,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:10,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:29:10,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:10,505 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 31 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:29:10,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 11:29:10,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496200865] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:10,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:10,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-03-04 11:29:10,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684936755] [2025-03-04 11:29:10,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:10,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:29:10,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:10,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:29:10,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:29:10,687 INFO L87 Difference]: Start difference. First operand 166 states and 192 transitions. Second operand has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:29:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:10,852 INFO L93 Difference]: Finished difference Result 283 states and 324 transitions. [2025-03-04 11:29:10,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:29:10,852 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 70 [2025-03-04 11:29:10,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:10,854 INFO L225 Difference]: With dead ends: 283 [2025-03-04 11:29:10,854 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 11:29:10,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 134 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:29:10,855 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 79 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:10,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 293 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:10,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 11:29:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 166. [2025-03-04 11:29:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 128 states have (on average 1.0859375) internal successors, (139), 132 states have internal predecessors, (139), 20 states have call successors, (20), 9 states have call predecessors, (20), 14 states have return successors, (31), 24 states have call predecessors, (31), 19 states have call successors, (31) [2025-03-04 11:29:10,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 190 transitions. [2025-03-04 11:29:10,863 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 190 transitions. Word has length 70 [2025-03-04 11:29:10,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:10,863 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 190 transitions. [2025-03-04 11:29:10,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:29:10,863 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 190 transitions. [2025-03-04 11:29:10,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 11:29:10,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:10,864 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 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-04 11:29:10,870 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-04 11:29:11,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:11,065 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:11,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:11,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1909073672, now seen corresponding path program 1 times [2025-03-04 11:29:11,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:11,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167239274] [2025-03-04 11:29:11,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:11,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:11,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 11:29:11,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 11:29:11,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:11,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:29:11,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:11,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167239274] [2025-03-04 11:29:11,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167239274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:11,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614261949] [2025-03-04 11:29:11,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:11,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:11,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:11,144 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-04 11:29:11,146 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-04 11:29:11,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 11:29:11,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 11:29:11,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:11,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:11,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:29:11,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:29:11,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:29:11,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614261949] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:11,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:11,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2025-03-04 11:29:11,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764308177] [2025-03-04 11:29:11,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:11,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:29:11,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:11,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:29:11,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:29:11,292 INFO L87 Difference]: Start difference. First operand 166 states and 190 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:29:11,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:11,384 INFO L93 Difference]: Finished difference Result 266 states and 301 transitions. [2025-03-04 11:29:11,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:29:11,384 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 71 [2025-03-04 11:29:11,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:11,385 INFO L225 Difference]: With dead ends: 266 [2025-03-04 11:29:11,385 INFO L226 Difference]: Without dead ends: 167 [2025-03-04 11:29:11,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 137 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:29:11,386 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 66 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:11,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 214 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-04 11:29:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2025-03-04 11:29:11,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 126 states have (on average 1.0873015873015872) internal successors, (137), 131 states have internal predecessors, (137), 20 states have call successors, (20), 9 states have call predecessors, (20), 14 states have return successors, (30), 23 states have call predecessors, (30), 19 states have call successors, (30) [2025-03-04 11:29:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 187 transitions. [2025-03-04 11:29:11,396 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 187 transitions. Word has length 71 [2025-03-04 11:29:11,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:11,396 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 187 transitions. [2025-03-04 11:29:11,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:29:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 187 transitions. [2025-03-04 11:29:11,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 11:29:11,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:11,397 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 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-04 11:29:11,404 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-04 11:29:11,598 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-04 11:29:11,598 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:11,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:11,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1673098567, now seen corresponding path program 1 times [2025-03-04 11:29:11,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:11,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413795514] [2025-03-04 11:29:11,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:11,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:11,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 11:29:11,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 11:29:11,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:11,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:11,760 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 17 proven. 38 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:29:11,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:11,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413795514] [2025-03-04 11:29:11,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413795514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:11,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973810644] [2025-03-04 11:29:11,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:11,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:11,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:11,762 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-04 11:29:11,764 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-04 11:29:11,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 11:29:11,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 11:29:11,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:11,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:11,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:29:11,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-04 11:29:11,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 11:29:12,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973810644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:12,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:12,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 11] total 30 [2025-03-04 11:29:12,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615518638] [2025-03-04 11:29:12,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:12,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 11:29:12,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:12,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 11:29:12,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:29:12,294 INFO L87 Difference]: Start difference. First operand 164 states and 187 transitions. Second operand has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 27 states have internal predecessors, (102), 13 states have call successors, (16), 4 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-04 11:29:13,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:13,172 INFO L93 Difference]: Finished difference Result 324 states and 377 transitions. [2025-03-04 11:29:13,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 11:29:13,174 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 27 states have internal predecessors, (102), 13 states have call successors, (16), 4 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 10 states have call successors, (16) Word has length 75 [2025-03-04 11:29:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:13,175 INFO L225 Difference]: With dead ends: 324 [2025-03-04 11:29:13,175 INFO L226 Difference]: Without dead ends: 194 [2025-03-04 11:29:13,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 143 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=471, Invalid=3311, Unknown=0, NotChecked=0, Total=3782 [2025-03-04 11:29:13,179 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 174 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:13,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 350 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:29:13,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-04 11:29:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 166. [2025-03-04 11:29:13,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 127 states have (on average 1.078740157480315) internal successors, (137), 133 states have internal predecessors, (137), 20 states have call successors, (20), 9 states have call predecessors, (20), 15 states have return successors, (30), 23 states have call predecessors, (30), 19 states have call successors, (30) [2025-03-04 11:29:13,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 187 transitions. [2025-03-04 11:29:13,188 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 187 transitions. Word has length 75 [2025-03-04 11:29:13,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:13,188 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 187 transitions. [2025-03-04 11:29:13,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 27 states have internal predecessors, (102), 13 states have call successors, (16), 4 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-04 11:29:13,188 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 187 transitions. [2025-03-04 11:29:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 11:29:13,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:13,189 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 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-04 11:29:13,199 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-04 11:29:13,394 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-04 11:29:13,395 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:13,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1729310121, now seen corresponding path program 1 times [2025-03-04 11:29:13,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:13,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94942434] [2025-03-04 11:29:13,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:13,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:13,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 11:29:13,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 11:29:13,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:13,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 11:29:13,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:13,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94942434] [2025-03-04 11:29:13,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94942434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:13,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067110765] [2025-03-04 11:29:13,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:13,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:13,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:13,450 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-04 11:29:13,451 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-04 11:29:13,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 11:29:13,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 11:29:13,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:13,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:13,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:29:13,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 11:29:13,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 11:29:13,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067110765] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:13,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:13,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 15 [2025-03-04 11:29:13,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379341504] [2025-03-04 11:29:13,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:13,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:29:13,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:13,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:29:13,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:29:13,763 INFO L87 Difference]: Start difference. First operand 166 states and 187 transitions. Second operand has 15 states, 14 states have (on average 5.642857142857143) internal successors, (79), 13 states have internal predecessors, (79), 9 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-04 11:29:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:13,913 INFO L93 Difference]: Finished difference Result 273 states and 311 transitions. [2025-03-04 11:29:13,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:29:13,914 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.642857142857143) internal successors, (79), 13 states have internal predecessors, (79), 9 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12) Word has length 88 [2025-03-04 11:29:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:13,915 INFO L225 Difference]: With dead ends: 273 [2025-03-04 11:29:13,915 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 11:29:13,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 163 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:29:13,916 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 107 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:13,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 212 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:13,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 11:29:13,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2025-03-04 11:29:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 116 states have (on average 1.0689655172413792) internal successors, (124), 122 states have internal predecessors, (124), 18 states have call successors, (18), 9 states have call predecessors, (18), 14 states have return successors, (25), 20 states have call predecessors, (25), 17 states have call successors, (25) [2025-03-04 11:29:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2025-03-04 11:29:13,927 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 88 [2025-03-04 11:29:13,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:13,927 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2025-03-04 11:29:13,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.642857142857143) internal successors, (79), 13 states have internal predecessors, (79), 9 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-04 11:29:13,927 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2025-03-04 11:29:13,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 11:29:13,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:13,928 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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-04 11:29:13,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:14,129 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-04 11:29:14,129 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:14,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:14,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1757801908, now seen corresponding path program 2 times [2025-03-04 11:29:14,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:14,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714020760] [2025-03-04 11:29:14,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:14,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:14,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-04 11:29:14,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 11:29:14,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:14,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 11:29:14,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:14,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714020760] [2025-03-04 11:29:14,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714020760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:14,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107803535] [2025-03-04 11:29:14,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:14,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:14,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:14,338 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-04 11:29:14,340 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-04 11:29:14,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-04 11:29:14,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 11:29:14,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:14,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:14,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 11:29:14,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 11:29:14,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 11:29:14,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107803535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:14,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:14,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 34 [2025-03-04 11:29:14,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730005312] [2025-03-04 11:29:14,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:14,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 11:29:14,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:14,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 11:29:14,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 11:29:14,902 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 35 states have internal predecessors, (95), 10 states have call successors, (12), 1 states have call predecessors, (12), 13 states have return successors, (21), 21 states have call predecessors, (21), 10 states have call successors, (21) [2025-03-04 11:29:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:15,170 INFO L93 Difference]: Finished difference Result 187 states and 213 transitions. [2025-03-04 11:29:15,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 11:29:15,170 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 35 states have internal predecessors, (95), 10 states have call successors, (12), 1 states have call predecessors, (12), 13 states have return successors, (21), 21 states have call predecessors, (21), 10 states have call successors, (21) Word has length 89 [2025-03-04 11:29:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:15,171 INFO L225 Difference]: With dead ends: 187 [2025-03-04 11:29:15,171 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 11:29:15,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 154 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=1721, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 11:29:15,172 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:15,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 576 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 11:29:15,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 150. [2025-03-04 11:29:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 116 states have (on average 1.0517241379310345) internal successors, (122), 120 states have internal predecessors, (122), 18 states have call successors, (18), 9 states have call predecessors, (18), 14 states have return successors, (25), 20 states have call predecessors, (25), 17 states have call successors, (25) [2025-03-04 11:29:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2025-03-04 11:29:15,182 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 89 [2025-03-04 11:29:15,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:15,182 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2025-03-04 11:29:15,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 35 states have internal predecessors, (95), 10 states have call successors, (12), 1 states have call predecessors, (12), 13 states have return successors, (21), 21 states have call predecessors, (21), 10 states have call successors, (21) [2025-03-04 11:29:15,183 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2025-03-04 11:29:15,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 11:29:15,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:15,183 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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-04 11:29:15,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 11:29:15,383 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-04 11:29:15,384 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:15,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:15,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1342715685, now seen corresponding path program 1 times [2025-03-04 11:29:15,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:15,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271477688] [2025-03-04 11:29:15,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:15,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:15,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 11:29:15,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 11:29:15,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:15,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:15,563 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 11:29:15,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:15,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271477688] [2025-03-04 11:29:15,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271477688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:15,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448794330] [2025-03-04 11:29:15,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:15,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:15,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:15,565 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:15,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:29:15,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 11:29:15,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 11:29:15,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:15,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:15,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 11:29:15,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-04 11:29:15,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 11:29:16,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448794330] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:16,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:16,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 16] total 33 [2025-03-04 11:29:16,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228755373] [2025-03-04 11:29:16,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:16,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 11:29:16,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:16,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 11:29:16,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:29:16,052 INFO L87 Difference]: Start difference. First operand 150 states and 165 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-04 11:29:16,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:16,180 INFO L93 Difference]: Finished difference Result 171 states and 187 transitions. [2025-03-04 11:29:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 11:29:16,180 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 90 [2025-03-04 11:29:16,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:16,181 INFO L225 Difference]: With dead ends: 171 [2025-03-04 11:29:16,181 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 11:29:16,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 157 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=1212, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 11:29:16,182 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 10 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:16,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 474 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 11:29:16,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 124. [2025-03-04 11:29:16,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 100 states have internal predecessors, (100), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2025-03-04 11:29:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2025-03-04 11:29:16,189 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 90 [2025-03-04 11:29:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:16,189 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2025-03-04 11:29:16,189 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-04 11:29:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2025-03-04 11:29:16,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 11:29:16,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:16,190 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:16,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 11:29:16,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:16,390 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:16,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:16,391 INFO L85 PathProgramCache]: Analyzing trace with hash 949222217, now seen corresponding path program 1 times [2025-03-04 11:29:16,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:16,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443696481] [2025-03-04 11:29:16,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:16,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:16,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 11:29:16,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 11:29:16,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:16,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 68 proven. 27 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:29:16,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:16,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443696481] [2025-03-04 11:29:16,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443696481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:16,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729117551] [2025-03-04 11:29:16,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:16,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:16,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:16,521 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:16,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:29:16,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 11:29:16,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 11:29:16,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:16,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:16,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:29:16,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 68 proven. 27 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:29:16,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 68 proven. 27 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:29:16,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729117551] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:16,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:16,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2025-03-04 11:29:16,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502123403] [2025-03-04 11:29:16,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:16,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:29:16,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:16,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:29:16,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:29:16,803 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:29:16,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:16,902 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2025-03-04 11:29:16,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:29:16,903 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 124 [2025-03-04 11:29:16,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:16,903 INFO L225 Difference]: With dead ends: 137 [2025-03-04 11:29:16,904 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 11:29:16,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 242 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:29:16,904 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 60 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:16,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 138 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:16,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 11:29:16,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-04 11:29:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 98 states have internal predecessors, (98), 15 states have call successors, (15), 9 states have call predecessors, (15), 11 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2025-03-04 11:29:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2025-03-04 11:29:16,911 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 124 [2025-03-04 11:29:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:16,912 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2025-03-04 11:29:16,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:29:16,912 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2025-03-04 11:29:16,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 11:29:16,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:16,914 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 11:29:16,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 11:29:17,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 11:29:17,115 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 11:29:17,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:17,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1239986378, now seen corresponding path program 2 times [2025-03-04 11:29:17,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:17,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334690166] [2025-03-04 11:29:17,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:17,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:17,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-04 11:29:17,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 11:29:17,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:17,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:17,457 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 45 proven. 85 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-04 11:29:17,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:17,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334690166] [2025-03-04 11:29:17,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334690166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:17,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674572935] [2025-03-04 11:29:17,458 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:17,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:17,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:17,459 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:17,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:29:17,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-04 11:29:17,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 11:29:17,515 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:17,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:17,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 11:29:17,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 45 proven. 59 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 11:29:17,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 74 proven. 54 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-04 11:29:18,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674572935] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:18,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:18,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 22] total 44 [2025-03-04 11:29:18,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579573894] [2025-03-04 11:29:18,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:18,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 11:29:18,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:18,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 11:29:18,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1724, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 11:29:18,643 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 11 states have call successors, (13), 1 states have call predecessors, (13), 15 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) [2025-03-04 11:29:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:18,786 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2025-03-04 11:29:18,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 11:29:18,787 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 11 states have call successors, (13), 1 states have call predecessors, (13), 15 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) Word has length 143 [2025-03-04 11:29:18,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:18,787 INFO L225 Difference]: With dead ends: 147 [2025-03-04 11:29:18,787 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:29:18,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 257 SyntacticMatches, 13 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=1879, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 11:29:18,789 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:18,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 561 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:18,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:29:18,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:29:18,789 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-04 11:29:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:29:18,789 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2025-03-04 11:29:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:18,790 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:29:18,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 11 states have call successors, (13), 1 states have call predecessors, (13), 15 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) [2025-03-04 11:29:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:29:18,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:29:18,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-04 11:29:18,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-04 11:29:18,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-04 11:29:18,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-04 11:29:18,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-04 11:29:18,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-04 11:29:18,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-04 11:29:18,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-04 11:29:18,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-04 11:29:18,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-04 11:29:18,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-04 11:29:18,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-04 11:29:18,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 11:29:18,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 11:29:18,999 INFO L422 BasicCegarLoop]: Path program histogram: [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-04 11:29:19,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:29:20,889 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:29:20,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:29:20 BoogieIcfgContainer [2025-03-04 11:29:20,892 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:29:20,893 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:29:20,893 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:29:20,893 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:29:20,893 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:29:02" (3/4) ... [2025-03-04 11:29:20,895 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:29:20,899 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibo2 [2025-03-04 11:29:20,899 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibo1 [2025-03-04 11:29:20,901 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 11:29:20,901 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:29:20,901 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:29:20,902 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:29:20,951 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:29:20,951 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:29:20,951 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:29:20,951 INFO L158 Benchmark]: Toolchain (without parser) took 18706.04ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 112.4MB in the beginning and 154.6MB in the end (delta: -42.2MB). Peak memory consumption was 213.5MB. Max. memory is 16.1GB. [2025-03-04 11:29:20,951 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:29:20,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.22ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 101.2MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:29:20,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.16ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 100.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:29:20,952 INFO L158 Benchmark]: Boogie Preprocessor took 22.69ms. Allocated memory is still 142.6MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:29:20,952 INFO L158 Benchmark]: IcfgBuilder took 248.24ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 87.9MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 11:29:20,954 INFO L158 Benchmark]: TraceAbstraction took 18205.43ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 86.8MB in the beginning and 162.8MB in the end (delta: -76.0MB). Peak memory consumption was 206.5MB. Max. memory is 16.1GB. [2025-03-04 11:29:20,954 INFO L158 Benchmark]: Witness Printer took 57.90ms. Allocated memory is still 402.7MB. Free memory was 162.8MB in the beginning and 154.6MB in the end (delta: 8.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:29:20,955 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.97ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 144.22ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 101.2MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.16ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 100.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.69ms. Allocated memory is still 142.6MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 248.24ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 87.9MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18205.43ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 86.8MB in the beginning and 162.8MB in the end (delta: -76.0MB). Peak memory consumption was 206.5MB. Max. memory is 16.1GB. * Witness Printer took 57.90ms. Allocated memory is still 402.7MB. Free memory was 162.8MB in the beginning and 154.6MB in the end (delta: 8.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 53 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 27, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1363 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1308 mSDsluCounter, 6524 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5545 mSDsCounter, 388 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6214 IncrementalHoareTripleChecker+Invalid, 6602 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 388 mSolverCounterUnsat, 979 mSDtfsCounter, 6214 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2420 GetRequests, 1911 SyntacticMatches, 69 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4449 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=17, InterpolantAutomatonStates: 328, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 299 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 2616 NumberOfCodeBlocks, 2616 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3520 ConstructedInterpolants, 0 QuantifiedInterpolants, 7299 SizeOfPredicates, 25 NumberOfNonLiveVariables, 2391 ConjunctsInSsa, 177 ConjunctsInUnsatCore, 55 InterpolantComputations, 15 PerfectInterpolantSequences, 3109/3915 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-04 11:29:20,968 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