./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_7-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 40add90db9f8d501baba3978de407d6383e788a1a5fafc7225d7676b58d18c84 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:42:15,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:42:15,143 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:42:15,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:42:15,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:42:15,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:42:15,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:42:15,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:42:15,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:42:15,166 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:42:15,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:42:15,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:42:15,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:42:15,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:42:15,168 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:42:15,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:42:15,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:42:15,168 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:42:15,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:42:15,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:42:15,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:42:15,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:42:15,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:42:15,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:42:15,169 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:42:15,169 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:42:15,169 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:42:15,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:42:15,169 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:42:15,169 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:42:15,169 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:42:15,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:42:15,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:42:15,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:42:15,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:42:15,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:42:15,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:42:15,170 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:42:15,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:42:15,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:42:15,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:42:15,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:42:15,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:42:15,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:42:15,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:42:15,170 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 -> 40add90db9f8d501baba3978de407d6383e788a1a5fafc7225d7676b58d18c84 [2025-03-09 02:42:15,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:42:15,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:42:15,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:42:15,376 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:42:15,376 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:42:15,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2025-03-09 02:42:16,465 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77048282a/6a03c216e4ea4d68bdcf4be341197061/FLAGfb3990d7d [2025-03-09 02:42:16,678 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:42:16,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2025-03-09 02:42:16,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77048282a/6a03c216e4ea4d68bdcf4be341197061/FLAGfb3990d7d [2025-03-09 02:42:16,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77048282a/6a03c216e4ea4d68bdcf4be341197061 [2025-03-09 02:42:16,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:42:16,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:42:16,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:42:16,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:42:16,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:42:16,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:42:16" (1/1) ... [2025-03-09 02:42:16,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@913ff31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:42:16, skipping insertion in model container [2025-03-09 02:42:16,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:42:16" (1/1) ... [2025-03-09 02:42:16,716 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:42:16,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:42:16,817 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:42:16,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:42:16,837 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:42:16,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:42:16 WrapperNode [2025-03-09 02:42:16,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:42:16,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:42:16,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:42:16,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:42:16,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:42:16" (1/1) ... [2025-03-09 02:42:16,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:42:16" (1/1) ... [2025-03-09 02:42:16,862 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2025-03-09 02:42:16,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:42:16,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:42:16,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:42:16,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:42:16,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:42:16" (1/1) ... [2025-03-09 02:42:16,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:42:16" (1/1) ... [2025-03-09 02:42:16,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:42:16" (1/1) ... [2025-03-09 02:42:16,877 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 02:42:16,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:42:16" (1/1) ... [2025-03-09 02:42:16,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:42:16" (1/1) ... [2025-03-09 02:42:16,882 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:42:16" (1/1) ... [2025-03-09 02:42:16,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:42:16" (1/1) ... [2025-03-09 02:42:16,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:42:16" (1/1) ... [2025-03-09 02:42:16,884 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:42:16" (1/1) ... [2025-03-09 02:42:16,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:42:16,888 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:42:16,888 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:42:16,888 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:42:16,889 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:42:16" (1/1) ... [2025-03-09 02:42:16,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:42:16,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:42:16,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:42:16,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:42:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:42:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:42:16,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:42:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:42:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2025-03-09 02:42:16,936 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2025-03-09 02:42:16,970 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:42:16,971 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:42:17,047 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: havoc #t~ret4;havoc #t~ret5; [2025-03-09 02:42:17,052 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-09 02:42:17,052 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:42:17,060 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:42:17,061 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:42:17,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:42:17 BoogieIcfgContainer [2025-03-09 02:42:17,062 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:42:17,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:42:17,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:42:17,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:42:17,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:42:16" (1/3) ... [2025-03-09 02:42:17,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bca3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:42:17, skipping insertion in model container [2025-03-09 02:42:17,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:42:16" (2/3) ... [2025-03-09 02:42:17,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bca3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:42:17, skipping insertion in model container [2025-03-09 02:42:17,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:42:17" (3/3) ... [2025-03-09 02:42:17,070 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2025-03-09 02:42:17,081 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:42:17,082 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_7-2.c that has 2 procedures, 32 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-09 02:42:17,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:42:17,123 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;@2b1822a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:42:17,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 02:42:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:42:17,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 02:42:17,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:42:17,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:42:17,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:42:17,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:42:17,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1976054303, now seen corresponding path program 1 times [2025-03-09 02:42:17,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:42:17,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892899027] [2025-03-09 02:42:17,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:42:17,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:42:17,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 02:42:17,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 02:42:17,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:42:17,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:42:17,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:42:17,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892899027] [2025-03-09 02:42:17,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892899027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:42:17,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:42:17,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:42:17,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197434996] [2025-03-09 02:42:17,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:42:17,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:42:17,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:42:17,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:42:17,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:42:17,280 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:42:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:42:17,321 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-09 02:42:17,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:42:17,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 02:42:17,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:42:17,327 INFO L225 Difference]: With dead ends: 38 [2025-03-09 02:42:17,327 INFO L226 Difference]: Without dead ends: 24 [2025-03-09 02:42:17,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:42:17,333 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:42:17,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:42:17,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-09 02:42:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-09 02:42:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:42:17,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-09 02:42:17,360 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2025-03-09 02:42:17,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:42:17,360 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-09 02:42:17,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:42:17,360 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-09 02:42:17,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:42:17,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:42:17,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:42:17,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:42:17,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:42:17,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:42:17,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1128141252, now seen corresponding path program 1 times [2025-03-09 02:42:17,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:42:17,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69694918] [2025-03-09 02:42:17,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:42:17,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:42:17,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:42:17,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:42:17,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:42:17,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:42:17,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:42:17,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69694918] [2025-03-09 02:42:17,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69694918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:42:17,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:42:17,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:42:17,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432245196] [2025-03-09 02:42:17,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:42:17,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:42:17,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:42:17,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:42:17,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:42:17,435 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:42:17,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:42:17,503 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-03-09 02:42:17,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:42:17,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 02:42:17,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:42:17,504 INFO L225 Difference]: With dead ends: 24 [2025-03-09 02:42:17,504 INFO L226 Difference]: Without dead ends: 22 [2025-03-09 02:42:17,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:42:17,504 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:42:17,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:42:17,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-09 02:42:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-03-09 02:42:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:42:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-09 02:42:17,508 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 8 [2025-03-09 02:42:17,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:42:17,508 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-09 02:42:17,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:42:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-09 02:42:17,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 02:42:17,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:42:17,509 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:42:17,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:42:17,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:42:17,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:42:17,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2023302297, now seen corresponding path program 1 times [2025-03-09 02:42:17,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:42:17,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048999340] [2025-03-09 02:42:17,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:42:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:42:17,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 02:42:17,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 02:42:17,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:42:17,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:42:17,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:42:17,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048999340] [2025-03-09 02:42:17,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048999340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:42:17,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:42:17,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:42:17,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69885526] [2025-03-09 02:42:17,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:42:17,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:42:17,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:42:17,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:42:17,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:42:17,631 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:42:17,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:42:17,689 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2025-03-09 02:42:17,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:42:17,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-03-09 02:42:17,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:42:17,690 INFO L225 Difference]: With dead ends: 34 [2025-03-09 02:42:17,690 INFO L226 Difference]: Without dead ends: 32 [2025-03-09 02:42:17,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:42:17,691 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:42:17,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 76 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:42:17,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-09 02:42:17,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-03-09 02:42:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 02:42:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-09 02:42:17,702 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 23 [2025-03-09 02:42:17,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:42:17,704 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-09 02:42:17,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:42:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-09 02:42:17,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 02:42:17,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:42:17,705 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:42:17,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:42:17,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:42:17,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:42:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1013164860, now seen corresponding path program 1 times [2025-03-09 02:42:17,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:42:17,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100545030] [2025-03-09 02:42:17,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:42:17,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:42:17,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:42:17,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:42:17,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:42:17,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 02:42:17,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:42:17,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100545030] [2025-03-09 02:42:17,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100545030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:42:17,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23883485] [2025-03-09 02:42:17,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:42:17,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:42:17,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:42:17,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:42:17,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:42:17,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:42:17,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:42:17,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:42:17,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:17,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:42:17,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:42:17,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:42:17,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:42:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:42:18,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23883485] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:42:18,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:42:18,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-09 02:42:18,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848892264] [2025-03-09 02:42:18,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:42:18,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 02:42:18,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:42:18,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 02:42:18,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:42:18,048 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 15 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:42:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:42:18,532 INFO L93 Difference]: Finished difference Result 142 states and 214 transitions. [2025-03-09 02:42:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 02:42:18,533 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 24 [2025-03-09 02:42:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:42:18,534 INFO L225 Difference]: With dead ends: 142 [2025-03-09 02:42:18,534 INFO L226 Difference]: Without dead ends: 109 [2025-03-09 02:42:18,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2025-03-09 02:42:18,536 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 79 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:42:18,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 244 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:42:18,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-09 02:42:18,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2025-03-09 02:42:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 71 states have internal predecessors, (76), 12 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (43), 15 states have call predecessors, (43), 11 states have call successors, (43) [2025-03-09 02:42:18,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2025-03-09 02:42:18,551 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 24 [2025-03-09 02:42:18,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:42:18,551 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2025-03-09 02:42:18,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:42:18,551 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2025-03-09 02:42:18,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 02:42:18,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:42:18,557 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:42:18,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:42:18,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:42:18,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:42:18,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:42:18,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1779932149, now seen corresponding path program 2 times [2025-03-09 02:42:18,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:42:18,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560034184] [2025-03-09 02:42:18,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:42:18,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:42:18,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 02:42:18,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 02:42:18,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:42:18,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-09 02:42:18,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:42:18,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560034184] [2025-03-09 02:42:18,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560034184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:42:18,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691749162] [2025-03-09 02:42:18,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:42:18,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:42:18,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:42:18,864 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:42:18,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:42:18,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 02:42:18,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 02:42:18,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:42:18,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:18,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:42:18,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:42:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-09 02:42:18,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:42:18,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691749162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:42:18,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:42:18,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-09 02:42:18,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485898394] [2025-03-09 02:42:18,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:42:18,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:42:18,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:42:18,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:42:18,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:42:18,965 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:42:18,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:42:18,988 INFO L93 Difference]: Finished difference Result 98 states and 142 transitions. [2025-03-09 02:42:18,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:42:18,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-03-09 02:42:18,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:42:18,990 INFO L225 Difference]: With dead ends: 98 [2025-03-09 02:42:18,990 INFO L226 Difference]: Without dead ends: 97 [2025-03-09 02:42:18,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:42:18,991 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:42:18,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 58 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:42:18,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-09 02:42:19,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2025-03-09 02:42:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.095890410958904) internal successors, (80), 73 states have internal predecessors, (80), 12 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (43), 17 states have call predecessors, (43), 11 states have call successors, (43) [2025-03-09 02:42:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2025-03-09 02:42:19,008 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 135 transitions. Word has length 42 [2025-03-09 02:42:19,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:42:19,009 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 135 transitions. [2025-03-09 02:42:19,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:42:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 135 transitions. [2025-03-09 02:42:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-09 02:42:19,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:42:19,010 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:42:19,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:42:19,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:42:19,211 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:42:19,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:42:19,211 INFO L85 PathProgramCache]: Analyzing trace with hash -213800611, now seen corresponding path program 1 times [2025-03-09 02:42:19,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:42:19,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660996273] [2025-03-09 02:42:19,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:42:19,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:42:19,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 02:42:19,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 02:42:19,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:42:19,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-09 02:42:19,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:42:19,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660996273] [2025-03-09 02:42:19,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660996273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:42:19,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619596523] [2025-03-09 02:42:19,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:42:19,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:42:19,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:42:19,294 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:42:19,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:42:19,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 02:42:19,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 02:42:19,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:42:19,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:19,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:42:19,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:42:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:42:19,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:42:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:42:19,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619596523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:42:19,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:42:19,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 23 [2025-03-09 02:42:19,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991091923] [2025-03-09 02:42:19,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:42:19,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 02:42:19,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:42:19,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 02:42:19,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2025-03-09 02:42:19,578 INFO L87 Difference]: Start difference. First operand 94 states and 135 transitions. Second operand has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 17 states have internal predecessors, (66), 11 states have call successors, (13), 8 states have call predecessors, (13), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:42:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:42:20,082 INFO L93 Difference]: Finished difference Result 336 states and 540 transitions. [2025-03-09 02:42:20,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 02:42:20,083 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 17 states have internal predecessors, (66), 11 states have call successors, (13), 8 states have call predecessors, (13), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2025-03-09 02:42:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:42:20,089 INFO L225 Difference]: With dead ends: 336 [2025-03-09 02:42:20,089 INFO L226 Difference]: Without dead ends: 251 [2025-03-09 02:42:20,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=870, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 02:42:20,091 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 226 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:42:20,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 457 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:42:20,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-09 02:42:20,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 225. [2025-03-09 02:42:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 177 states have (on average 1.0960451977401129) internal successors, (194), 176 states have internal predecessors, (194), 28 states have call successors, (28), 8 states have call predecessors, (28), 18 states have return successors, (94), 40 states have call predecessors, (94), 27 states have call successors, (94) [2025-03-09 02:42:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 316 transitions. [2025-03-09 02:42:20,129 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 316 transitions. Word has length 37 [2025-03-09 02:42:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:42:20,129 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 316 transitions. [2025-03-09 02:42:20,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 17 states have internal predecessors, (66), 11 states have call successors, (13), 8 states have call predecessors, (13), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:42:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 316 transitions. [2025-03-09 02:42:20,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 02:42:20,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:42:20,130 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:42:20,136 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-09 02:42:20,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:42:20,335 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:42:20,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:42:20,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1080149815, now seen corresponding path program 1 times [2025-03-09 02:42:20,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:42:20,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123002886] [2025-03-09 02:42:20,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:42:20,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:42:20,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 02:42:20,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 02:42:20,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:42:20,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-03-09 02:42:20,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:42:20,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123002886] [2025-03-09 02:42:20,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123002886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:42:20,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:42:20,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:42:20,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543686640] [2025-03-09 02:42:20,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:42:20,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:42:20,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:42:20,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:42:20,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:42:20,414 INFO L87 Difference]: Start difference. First operand 225 states and 316 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:42:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:42:20,451 INFO L93 Difference]: Finished difference Result 252 states and 360 transitions. [2025-03-09 02:42:20,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:42:20,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2025-03-09 02:42:20,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:42:20,453 INFO L225 Difference]: With dead ends: 252 [2025-03-09 02:42:20,453 INFO L226 Difference]: Without dead ends: 251 [2025-03-09 02:42:20,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:42:20,454 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:42:20,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:42:20,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-09 02:42:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 236. [2025-03-09 02:42:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 186 states have (on average 1.0913978494623655) internal successors, (203), 184 states have internal predecessors, (203), 30 states have call successors, (30), 8 states have call predecessors, (30), 18 states have return successors, (106), 43 states have call predecessors, (106), 29 states have call successors, (106) [2025-03-09 02:42:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 339 transitions. [2025-03-09 02:42:20,472 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 339 transitions. Word has length 56 [2025-03-09 02:42:20,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:42:20,473 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 339 transitions. [2025-03-09 02:42:20,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:42:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 339 transitions. [2025-03-09 02:42:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-09 02:42:20,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:42:20,478 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:42:20,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:42:20,478 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:42:20,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:42:20,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1582837461, now seen corresponding path program 1 times [2025-03-09 02:42:20,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:42:20,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683537611] [2025-03-09 02:42:20,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:42:20,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:42:20,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-09 02:42:20,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 02:42:20,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:42:20,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2025-03-09 02:42:20,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:42:20,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683537611] [2025-03-09 02:42:20,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683537611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:42:20,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109840723] [2025-03-09 02:42:20,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:42:20,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:42:20,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:42:20,545 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:42:20,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:42:20,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-09 02:42:20,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 02:42:20,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:42:20,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:20,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 02:42:20,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:42:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 100 proven. 91 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:42:20,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:42:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 100 proven. 91 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:42:20,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109840723] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:42:20,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:42:20,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 17, 17] total 21 [2025-03-09 02:42:20,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835211121] [2025-03-09 02:42:20,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:42:20,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 02:42:20,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:42:20,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 02:42:20,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:42:20,983 INFO L87 Difference]: Start difference. First operand 236 states and 339 transitions. Second operand has 21 states, 20 states have (on average 3.65) internal successors, (73), 15 states have internal predecessors, (73), 10 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 02:42:21,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:42:21,333 INFO L93 Difference]: Finished difference Result 437 states and 657 transitions. [2025-03-09 02:42:21,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 02:42:21,334 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.65) internal successors, (73), 15 states have internal predecessors, (73), 10 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 74 [2025-03-09 02:42:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:42:21,335 INFO L225 Difference]: With dead ends: 437 [2025-03-09 02:42:21,335 INFO L226 Difference]: Without dead ends: 222 [2025-03-09 02:42:21,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 122 SyntacticMatches, 14 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=334, Invalid=926, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 02:42:21,338 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 260 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:42:21,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 138 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:42:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-09 02:42:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 196. [2025-03-09 02:42:21,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 153 states have (on average 1.0849673202614378) internal successors, (166), 155 states have internal predecessors, (166), 25 states have call successors, (25), 8 states have call predecessors, (25), 16 states have return successors, (48), 32 states have call predecessors, (48), 24 states have call successors, (48) [2025-03-09 02:42:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 239 transitions. [2025-03-09 02:42:21,366 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 239 transitions. Word has length 74 [2025-03-09 02:42:21,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:42:21,366 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 239 transitions. [2025-03-09 02:42:21,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.65) internal successors, (73), 15 states have internal predecessors, (73), 10 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 02:42:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 239 transitions. [2025-03-09 02:42:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 02:42:21,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:42:21,368 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 02:42:21,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 02:42:21,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:42:21,568 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:42:21,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:42:21,569 INFO L85 PathProgramCache]: Analyzing trace with hash 693465773, now seen corresponding path program 1 times [2025-03-09 02:42:21,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:42:21,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121928790] [2025-03-09 02:42:21,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:42:21,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:42:21,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:42:21,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:42:21,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:42:21,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 02:42:21,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:42:21,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121928790] [2025-03-09 02:42:21,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121928790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:42:21,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416137704] [2025-03-09 02:42:21,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:42:21,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:42:21,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:42:21,664 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:42:21,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:42:21,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:42:21,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:42:21,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:42:21,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:21,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:42:21,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:42:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-03-09 02:42:21,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:42:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-09 02:42:21,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416137704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:42:21,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:42:21,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-03-09 02:42:21,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540131692] [2025-03-09 02:42:21,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:42:21,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 02:42:21,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:42:21,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 02:42:21,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:42:21,891 INFO L87 Difference]: Start difference. First operand 196 states and 239 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 02:42:21,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:42:21,976 INFO L93 Difference]: Finished difference Result 206 states and 251 transitions. [2025-03-09 02:42:21,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 02:42:21,977 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) Word has length 69 [2025-03-09 02:42:21,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:42:21,986 INFO L225 Difference]: With dead ends: 206 [2025-03-09 02:42:21,986 INFO L226 Difference]: Without dead ends: 204 [2025-03-09 02:42:21,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:42:21,987 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:42:21,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 178 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:42:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-09 02:42:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196. [2025-03-09 02:42:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 153 states have (on average 1.0718954248366013) internal successors, (164), 155 states have internal predecessors, (164), 25 states have call successors, (25), 8 states have call predecessors, (25), 16 states have return successors, (48), 32 states have call predecessors, (48), 24 states have call successors, (48) [2025-03-09 02:42:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 237 transitions. [2025-03-09 02:42:21,997 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 237 transitions. Word has length 69 [2025-03-09 02:42:21,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:42:21,998 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 237 transitions. [2025-03-09 02:42:21,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 02:42:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 237 transitions. [2025-03-09 02:42:21,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 02:42:21,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:42:21,999 INFO L218 NwaCegarLoop]: trace histogram [11, 8, 7, 7, 7, 7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 02:42:22,005 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-09 02:42:22,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:42:22,200 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:42:22,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:42:22,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1181779696, now seen corresponding path program 2 times [2025-03-09 02:42:22,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:42:22,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117562771] [2025-03-09 02:42:22,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:42:22,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:42:22,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-09 02:42:22,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:42:22,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:42:22,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 93 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-09 02:42:22,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:42:22,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117562771] [2025-03-09 02:42:22,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117562771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:42:22,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526829158] [2025-03-09 02:42:22,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:42:22,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:42:22,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:42:22,417 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:42:22,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:42:22,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-09 02:42:22,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:42:22,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:42:22,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:22,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:42:22,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:42:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2025-03-09 02:42:22,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:42:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-03-09 02:42:22,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526829158] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:42:22,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:42:22,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 5] total 25 [2025-03-09 02:42:22,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174974952] [2025-03-09 02:42:22,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:42:22,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 02:42:22,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:42:22,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 02:42:22,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-03-09 02:42:22,714 INFO L87 Difference]: Start difference. First operand 196 states and 237 transitions. Second operand has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 20 states have internal predecessors, (80), 10 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-09 02:42:23,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:42:23,617 INFO L93 Difference]: Finished difference Result 373 states and 482 transitions. [2025-03-09 02:42:23,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-09 02:42:23,617 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 20 states have internal predecessors, (80), 10 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) Word has length 86 [2025-03-09 02:42:23,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:42:23,619 INFO L225 Difference]: With dead ends: 373 [2025-03-09 02:42:23,619 INFO L226 Difference]: Without dead ends: 198 [2025-03-09 02:42:23,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 164 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1150, Invalid=3680, Unknown=0, NotChecked=0, Total=4830 [2025-03-09 02:42:23,621 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 348 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:42:23,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 83 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:42:23,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-09 02:42:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 126. [2025-03-09 02:42:23,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 101 states have internal predecessors, (104), 17 states have call successors, (17), 8 states have call predecessors, (17), 9 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2025-03-09 02:42:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2025-03-09 02:42:23,632 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 86 [2025-03-09 02:42:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:42:23,632 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2025-03-09 02:42:23,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 20 states have internal predecessors, (80), 10 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-09 02:42:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2025-03-09 02:42:23,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-09 02:42:23,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:42:23,633 INFO L218 NwaCegarLoop]: trace histogram [17, 14, 14, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 1, 1, 1, 1] [2025-03-09 02:42:23,640 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-09 02:42:23,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:42:23,834 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:42:23,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:42:23,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1534683183, now seen corresponding path program 2 times [2025-03-09 02:42:23,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:42:23,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438232413] [2025-03-09 02:42:23,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:42:23,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:42:23,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 155 statements into 2 equivalence classes. [2025-03-09 02:42:23,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 155 of 155 statements. [2025-03-09 02:42:23,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:42:23,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 78 proven. 189 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2025-03-09 02:42:24,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:42:24,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438232413] [2025-03-09 02:42:24,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438232413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:42:24,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773539078] [2025-03-09 02:42:24,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:42:24,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:42:24,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:42:24,345 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:42:24,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 02:42:24,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 155 statements into 2 equivalence classes. [2025-03-09 02:42:24,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 155 of 155 statements. [2025-03-09 02:42:24,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:42:24,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:24,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 02:42:24,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:42:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2025-03-09 02:42:24,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:42:25,490 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 144 proven. 128 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2025-03-09 02:42:25,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773539078] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:42:25,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:42:25,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 17] total 31 [2025-03-09 02:42:25,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910551597] [2025-03-09 02:42:25,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:42:25,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 02:42:25,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:42:25,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 02:42:25,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2025-03-09 02:42:25,493 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand has 32 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 32 states have internal predecessors, (84), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (21), 21 states have call predecessors, (21), 8 states have call successors, (21) [2025-03-09 02:42:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:42:25,600 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2025-03-09 02:42:25,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 02:42:25,600 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 32 states have internal predecessors, (84), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (21), 21 states have call predecessors, (21), 8 states have call successors, (21) Word has length 155 [2025-03-09 02:42:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:42:25,601 INFO L225 Difference]: With dead ends: 152 [2025-03-09 02:42:25,601 INFO L226 Difference]: Without dead ends: 151 [2025-03-09 02:42:25,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 294 SyntacticMatches, 13 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 02:42:25,602 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:42:25,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 267 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:42:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-09 02:42:25,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 126. [2025-03-09 02:42:25,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 99 states have (on average 1.02020202020202) internal successors, (101), 101 states have internal predecessors, (101), 17 states have call successors, (17), 8 states have call predecessors, (17), 9 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2025-03-09 02:42:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2025-03-09 02:42:25,608 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 155 [2025-03-09 02:42:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:42:25,608 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2025-03-09 02:42:25,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 32 states have internal predecessors, (84), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (21), 21 states have call predecessors, (21), 8 states have call successors, (21) [2025-03-09 02:42:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2025-03-09 02:42:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-03-09 02:42:25,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:42:25,611 INFO L218 NwaCegarLoop]: trace histogram [41, 40, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 13, 8, 1, 1, 1, 1] [2025-03-09 02:42:25,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 02:42:25,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:42:25,815 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:42:25,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:42:25,815 INFO L85 PathProgramCache]: Analyzing trace with hash -912070000, now seen corresponding path program 3 times [2025-03-09 02:42:25,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:42:25,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683274483] [2025-03-09 02:42:25,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:42:25,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:42:25,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 398 statements into 29 equivalence classes. [2025-03-09 02:42:25,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) and asserted 398 of 398 statements. [2025-03-09 02:42:25,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2025-03-09 02:42:25,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5628 backedges. 850 proven. 1485 refuted. 0 times theorem prover too weak. 3293 trivial. 0 not checked. [2025-03-09 02:42:28,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:42:28,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683274483] [2025-03-09 02:42:28,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683274483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:42:28,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778549411] [2025-03-09 02:42:28,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:42:28,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:42:28,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:42:28,040 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:42:28,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:42:28,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 398 statements into 29 equivalence classes. [2025-03-09 02:42:28,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) and asserted 398 of 398 statements. [2025-03-09 02:42:28,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2025-03-09 02:42:28,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:28,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-09 02:42:28,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:42:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5628 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 3696 trivial. 0 not checked. [2025-03-09 02:42:28,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:42:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5628 backedges. 1149 proven. 1015 refuted. 0 times theorem prover too weak. 3464 trivial. 0 not checked. [2025-03-09 02:42:33,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778549411] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:42:33,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:42:33,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 29] total 46 [2025-03-09 02:42:33,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810636498] [2025-03-09 02:42:33,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:42:33,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-09 02:42:33,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:42:33,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-09 02:42:33,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1667, Unknown=0, NotChecked=0, Total=2162 [2025-03-09 02:42:33,510 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand has 47 states, 46 states have (on average 2.630434782608696) internal successors, (121), 47 states have internal predecessors, (121), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (32), 32 states have call predecessors, (32), 12 states have call successors, (32) [2025-03-09 02:42:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:42:33,593 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2025-03-09 02:42:33,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-09 02:42:33,593 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.630434782608696) internal successors, (121), 47 states have internal predecessors, (121), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (32), 32 states have call predecessors, (32), 12 states have call successors, (32) Word has length 398 [2025-03-09 02:42:33,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:42:33,594 INFO L225 Difference]: With dead ends: 151 [2025-03-09 02:42:33,594 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:42:33,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 779 SyntacticMatches, 51 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2548 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=525, Invalid=1731, Unknown=0, NotChecked=0, Total=2256 [2025-03-09 02:42:33,595 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:42:33,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 177 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:42:33,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:42:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:42:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:42:33,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:42:33,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 398 [2025-03-09 02:42:33,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:42:33,596 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:42:33,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.630434782608696) internal successors, (121), 47 states have internal predecessors, (121), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (32), 32 states have call predecessors, (32), 12 states have call successors, (32) [2025-03-09 02:42:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:42:33,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:42:33,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-09 02:42:33,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 02:42:33,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 02:42:33,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 02:42:33,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 02:42:33,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-09 02:42:33,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 02:42:33,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 02:42:33,804 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 02:42:33,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:42:34,693 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:42:34,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:42:34 BoogieIcfgContainer [2025-03-09 02:42:34,697 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:42:34,697 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:42:34,697 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:42:34,698 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:42:34,698 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:42:17" (3/4) ... [2025-03-09 02:42:34,699 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:42:34,703 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibo [2025-03-09 02:42:34,705 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 02:42:34,705 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:42:34,706 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:42:34,706 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:42:34,755 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:42:34,755 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:42:34,755 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:42:34,756 INFO L158 Benchmark]: Toolchain (without parser) took 18057.34ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 112.7MB in the beginning and 348.7MB in the end (delta: -236.0MB). Peak memory consumption was 114.9MB. Max. memory is 16.1GB. [2025-03-09 02:42:34,756 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:42:34,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 138.64ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 102.2MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:42:34,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.33ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 101.3MB in the end (delta: 925.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:42:34,756 INFO L158 Benchmark]: Boogie Preprocessor took 24.14ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 100.4MB in the end (delta: 914.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:42:34,756 INFO L158 Benchmark]: IcfgBuilder took 174.37ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 90.0MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:42:34,756 INFO L158 Benchmark]: TraceAbstraction took 17633.15ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 89.5MB in the beginning and 353.1MB in the end (delta: -263.5MB). Peak memory consumption was 215.5MB. Max. memory is 16.1GB. [2025-03-09 02:42:34,757 INFO L158 Benchmark]: Witness Printer took 57.73ms. Allocated memory is still 494.9MB. Free memory was 353.1MB in the beginning and 348.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:42:34,757 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.17ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 138.64ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 102.2MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.33ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 101.3MB in the end (delta: 925.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.14ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 100.4MB in the end (delta: 914.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 174.37ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 90.0MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17633.15ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 89.5MB in the beginning and 353.1MB in the end (delta: -263.5MB). Peak memory consumption was 215.5MB. Max. memory is 16.1GB. * Witness Printer took 57.73ms. Allocated memory is still 494.9MB. Free memory was 353.1MB in the beginning and 348.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 39 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 16.7s, OverallIterations: 12, TraceHistogramMax: 41, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 995 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 972 mSDsluCounter, 1824 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1532 mSDsCounter, 321 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2823 IncrementalHoareTripleChecker+Invalid, 3144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 321 mSolverCounterUnsat, 292 mSDtfsCounter, 2823 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1993 GetRequests, 1638 SyntacticMatches, 85 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4904 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=7, InterpolantAutomatonStates: 197, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 201 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 1864 NumberOfCodeBlocks, 1864 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 2680 ConstructedInterpolants, 0 QuantifiedInterpolants, 6266 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1783 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 27 InterpolantComputations, 5 PerfectInterpolantSequences, 17007/21544 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 02:42:34,769 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