./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-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 22d9a6832a4080412e38f5d573b63985f3b10b3c2009b6559595c7c0bbda414f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:41:36,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:41:36,843 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:41:36,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:41:36,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:41:36,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:41:36,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:41:36,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:41:36,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:41:36,873 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:41:36,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:41:36,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:41:36,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:41:36,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:41:36,874 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:41:36,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:41:36,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:41:36,874 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:41:36,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:41:36,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:41:36,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:41:36,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:41:36,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:41:36,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:41:36,875 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:41:36,875 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:41:36,875 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:41:36,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:41:36,875 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:41:36,875 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:41:36,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:41:36,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:41:36,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:41:36,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:41:36,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:41:36,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:41:36,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:41:36,876 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:41:36,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:41:36,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:41:36,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:41:36,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:41:36,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:41:36,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:41:36,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:41:36,877 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 -> 22d9a6832a4080412e38f5d573b63985f3b10b3c2009b6559595c7c0bbda414f [2025-03-09 02:41:37,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:41:37,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:41:37,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:41:37,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:41:37,120 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:41:37,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_4-2.c [2025-03-09 02:41:38,305 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31920c426/cb3e237dd433416a87a65325f01f943b/FLAG2584ae4cb [2025-03-09 02:41:38,499 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:41:38,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_4-2.c [2025-03-09 02:41:38,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31920c426/cb3e237dd433416a87a65325f01f943b/FLAG2584ae4cb [2025-03-09 02:41:38,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31920c426/cb3e237dd433416a87a65325f01f943b [2025-03-09 02:41:38,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:41:38,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:41:38,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:41:38,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:41:38,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:41:38,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:41:38" (1/1) ... [2025-03-09 02:41:38,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c881f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:38, skipping insertion in model container [2025-03-09 02:41:38,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:41:38" (1/1) ... [2025-03-09 02:41:38,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:41:38,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:41:38,974 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:41:38,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:41:38,990 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:41:38,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:38 WrapperNode [2025-03-09 02:41:38,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:41:38,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:41:38,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:41:38,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:41:38,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:38" (1/1) ... [2025-03-09 02:41:39,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:38" (1/1) ... [2025-03-09 02:41:39,011 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2025-03-09 02:41:39,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:41:39,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:41:39,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:41:39,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:41:39,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:38" (1/1) ... [2025-03-09 02:41:39,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:38" (1/1) ... [2025-03-09 02:41:39,019 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:38" (1/1) ... [2025-03-09 02:41:39,030 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 02:41:39,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:38" (1/1) ... [2025-03-09 02:41:39,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:38" (1/1) ... [2025-03-09 02:41:39,036 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:38" (1/1) ... [2025-03-09 02:41:39,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:38" (1/1) ... [2025-03-09 02:41:39,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:38" (1/1) ... [2025-03-09 02:41:39,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:38" (1/1) ... [2025-03-09 02:41:39,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:41:39,039 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:41:39,039 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:41:39,039 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:41:39,040 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:38" (1/1) ... [2025-03-09 02:41:39,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:41:39,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:39,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:41:39,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:41:39,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:41:39,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:41:39,089 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2025-03-09 02:41:39,089 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2025-03-09 02:41:39,089 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2025-03-09 02:41:39,089 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2025-03-09 02:41:39,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:41:39,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:41:39,131 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:41:39,133 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:41:39,231 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~ret6;havoc #t~ret7; [2025-03-09 02:41:39,267 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: havoc #t~ret4;havoc #t~ret5; [2025-03-09 02:41:39,274 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-09 02:41:39,274 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:41:39,282 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:41:39,282 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:41:39,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:41:39 BoogieIcfgContainer [2025-03-09 02:41:39,282 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:41:39,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:41:39,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:41:39,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:41:39,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:41:38" (1/3) ... [2025-03-09 02:41:39,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635061df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:41:39, skipping insertion in model container [2025-03-09 02:41:39,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:38" (2/3) ... [2025-03-09 02:41:39,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635061df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:41:39, skipping insertion in model container [2025-03-09 02:41:39,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:41:39" (3/3) ... [2025-03-09 02:41:39,292 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-2.c [2025-03-09 02:41:39,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:41:39,305 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_2calls_4-2.c that has 3 procedures, 53 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-09 02:41:39,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:41:39,353 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;@2bd5e480, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:41:39,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-09 02:41:39,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 45 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:41:39,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 02:41:39,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:39,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:39,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:39,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:39,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1954105288, now seen corresponding path program 1 times [2025-03-09 02:41:39,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:39,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105577781] [2025-03-09 02:41:39,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:39,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:39,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 02:41:39,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 02:41:39,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:39,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:39,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:39,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105577781] [2025-03-09 02:41:39,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105577781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:39,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:39,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:41:39,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610676318] [2025-03-09 02:41:39,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:39,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:41:39,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:39,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:41:39,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:41:39,492 INFO L87 Difference]: Start difference. First operand has 53 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 45 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:39,530 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-03-09 02:41:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:41:39,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 02:41:39,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:39,535 INFO L225 Difference]: With dead ends: 59 [2025-03-09 02:41:39,535 INFO L226 Difference]: Without dead ends: 45 [2025-03-09 02:41:39,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:41:39,538 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 11 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:39,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 92 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:39,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-09 02:41:39,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-03-09 02:41:39,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 36 states have internal predecessors, (40), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:41:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-09 02:41:39,564 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 7 [2025-03-09 02:41:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:39,564 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-09 02:41:39,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-03-09 02:41:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:41:39,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:39,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:39,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:41:39,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:39,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:39,566 INFO L85 PathProgramCache]: Analyzing trace with hash -447721764, now seen corresponding path program 1 times [2025-03-09 02:41:39,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:39,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391940464] [2025-03-09 02:41:39,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:39,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:39,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:41:39,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:41:39,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:39,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:39,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:39,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391940464] [2025-03-09 02:41:39,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391940464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:39,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:39,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:39,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226888343] [2025-03-09 02:41:39,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:39,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:39,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:39,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:39,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:39,629 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:39,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:39,686 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2025-03-09 02:41:39,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:39,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 02:41:39,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:39,688 INFO L225 Difference]: With dead ends: 64 [2025-03-09 02:41:39,688 INFO L226 Difference]: Without dead ends: 58 [2025-03-09 02:41:39,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:41:39,689 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 26 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:39,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 164 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-09 02:41:39,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-03-09 02:41:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 46 states have internal predecessors, (52), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 02:41:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2025-03-09 02:41:39,698 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 8 [2025-03-09 02:41:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:39,699 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2025-03-09 02:41:39,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:39,699 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2025-03-09 02:41:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 02:41:39,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:39,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:39,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:41:39,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibo2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:39,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:39,701 INFO L85 PathProgramCache]: Analyzing trace with hash -2145956475, now seen corresponding path program 1 times [2025-03-09 02:41:39,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:39,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23883485] [2025-03-09 02:41:39,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:39,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:39,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 02:41:39,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 02:41:39,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:39,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:39,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23883485] [2025-03-09 02:41:39,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23883485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:39,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:39,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:41:39,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227306079] [2025-03-09 02:41:39,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:39,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:41:39,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:39,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:41:39,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:41:39,734 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:39,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:39,755 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2025-03-09 02:41:39,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:41:39,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-09 02:41:39,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:39,756 INFO L225 Difference]: With dead ends: 58 [2025-03-09 02:41:39,756 INFO L226 Difference]: Without dead ends: 56 [2025-03-09 02:41:39,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:41:39,757 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:39,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 72 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-09 02:41:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-03-09 02:41:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 44 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 02:41:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-03-09 02:41:39,768 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 13 [2025-03-09 02:41:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:39,768 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-03-09 02:41:39,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:39,768 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-03-09 02:41:39,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 02:41:39,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:39,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:39,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:41:39,769 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:39,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:39,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2100141288, now seen corresponding path program 1 times [2025-03-09 02:41:39,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:39,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008584251] [2025-03-09 02:41:39,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:39,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:39,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 02:41:39,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 02:41:39,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:39,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:39,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:39,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008584251] [2025-03-09 02:41:39,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008584251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:39,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:39,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:41:39,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751229682] [2025-03-09 02:41:39,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:39,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:41:39,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:39,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:41:39,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:41:39,862 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:39,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:39,988 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2025-03-09 02:41:39,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:41:39,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-09 02:41:39,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:39,989 INFO L225 Difference]: With dead ends: 58 [2025-03-09 02:41:39,989 INFO L226 Difference]: Without dead ends: 54 [2025-03-09 02:41:39,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:41:39,990 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:39,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 102 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-09 02:41:39,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2025-03-09 02:41:39,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 40 states have internal predecessors, (46), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 02:41:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-03-09 02:41:39,996 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 14 [2025-03-09 02:41:39,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:39,996 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-03-09 02:41:39,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-03-09 02:41:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 02:41:39,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:39,996 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:39,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:41:39,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:39,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:39,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1831817774, now seen corresponding path program 1 times [2025-03-09 02:41:39,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:39,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677588344] [2025-03-09 02:41:39,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:39,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:40,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 02:41:40,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 02:41:40,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:40,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:41:40,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:40,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677588344] [2025-03-09 02:41:40,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677588344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:40,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:40,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:40,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552698764] [2025-03-09 02:41:40,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:40,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:40,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:40,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:40,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:40,097 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:41:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:40,126 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2025-03-09 02:41:40,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:40,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-03-09 02:41:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:40,128 INFO L225 Difference]: With dead ends: 74 [2025-03-09 02:41:40,129 INFO L226 Difference]: Without dead ends: 69 [2025-03-09 02:41:40,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:40,130 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:40,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 115 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:40,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-09 02:41:40,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-03-09 02:41:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2025-03-09 02:41:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2025-03-09 02:41:40,140 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 23 [2025-03-09 02:41:40,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:40,140 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2025-03-09 02:41:40,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:41:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2025-03-09 02:41:40,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 02:41:40,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:40,143 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:40,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:41:40,143 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:40,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:40,144 INFO L85 PathProgramCache]: Analyzing trace with hash -631666365, now seen corresponding path program 1 times [2025-03-09 02:41:40,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:40,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887286788] [2025-03-09 02:41:40,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:40,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:40,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:41:40,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:41:40,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:40,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:41:40,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:40,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887286788] [2025-03-09 02:41:40,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887286788] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:40,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619723299] [2025-03-09 02:41:40,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:40,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:40,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:40,240 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:40,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:41:40,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:41:40,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:41:40,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:40,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:40,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:41:40,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:40,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:41:40,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619723299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:40,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:41:40,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2025-03-09 02:41:40,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181901142] [2025-03-09 02:41:40,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:40,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:41:40,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:40,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:41:40,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:41:40,345 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:41:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:40,432 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2025-03-09 02:41:40,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:41:40,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-03-09 02:41:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:40,433 INFO L225 Difference]: With dead ends: 117 [2025-03-09 02:41:40,433 INFO L226 Difference]: Without dead ends: 63 [2025-03-09 02:41:40,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:41:40,434 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:40,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 176 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-09 02:41:40,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-03-09 02:41:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.2) internal successors, (54), 49 states have internal predecessors, (54), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-09 02:41:40,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2025-03-09 02:41:40,440 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 24 [2025-03-09 02:41:40,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:40,440 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2025-03-09 02:41:40,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:41:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2025-03-09 02:41:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 02:41:40,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:40,441 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:40,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:40,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 02:41:40,643 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:40,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:40,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2003454357, now seen corresponding path program 1 times [2025-03-09 02:41:40,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:40,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778146643] [2025-03-09 02:41:40,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:40,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:40,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 02:41:40,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 02:41:40,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:40,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:41:40,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:40,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778146643] [2025-03-09 02:41:40,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778146643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:40,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:40,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:40,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624547478] [2025-03-09 02:41:40,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:40,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:40,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:40,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:40,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:40,693 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:41:40,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:40,721 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2025-03-09 02:41:40,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:40,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-09 02:41:40,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:40,722 INFO L225 Difference]: With dead ends: 75 [2025-03-09 02:41:40,722 INFO L226 Difference]: Without dead ends: 73 [2025-03-09 02:41:40,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:40,723 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:40,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 148 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:40,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-09 02:41:40,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2025-03-09 02:41:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 56 states have internal predecessors, (61), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-09 02:41:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2025-03-09 02:41:40,728 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 29 [2025-03-09 02:41:40,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:40,728 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2025-03-09 02:41:40,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:41:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2025-03-09 02:41:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:41:40,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:40,729 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:40,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:41:40,729 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:40,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1424432597, now seen corresponding path program 1 times [2025-03-09 02:41:40,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:40,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696252246] [2025-03-09 02:41:40,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:40,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:40,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:41:40,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:41:40,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:40,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 02:41:40,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:40,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696252246] [2025-03-09 02:41:40,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696252246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:40,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756146800] [2025-03-09 02:41:40,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:40,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:40,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:40,781 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:40,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:41:40,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:41:40,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:41:40,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:40,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:40,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:41:40,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:40,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:41:41,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756146800] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:41,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:41,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-09 02:41:41,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97865934] [2025-03-09 02:41:41,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:41,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 02:41:41,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:41,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 02:41:41,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:41:41,022 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 19 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 15 states have internal predecessors, (59), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:41:41,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:41,336 INFO L93 Difference]: Finished difference Result 175 states and 228 transitions. [2025-03-09 02:41:41,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:41:41,337 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 15 states have internal predecessors, (59), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 30 [2025-03-09 02:41:41,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:41,338 INFO L225 Difference]: With dead ends: 175 [2025-03-09 02:41:41,338 INFO L226 Difference]: Without dead ends: 114 [2025-03-09 02:41:41,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-03-09 02:41:41,339 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 120 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:41,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 464 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:41:41,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-09 02:41:41,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2025-03-09 02:41:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 80 states have internal predecessors, (89), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (26), 14 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-09 02:41:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 128 transitions. [2025-03-09 02:41:41,353 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 128 transitions. Word has length 30 [2025-03-09 02:41:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:41,353 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 128 transitions. [2025-03-09 02:41:41,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 15 states have internal predecessors, (59), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:41:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 128 transitions. [2025-03-09 02:41:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-09 02:41:41,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:41,354 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:41,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:41,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-09 02:41:41,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:41,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash 853527359, now seen corresponding path program 1 times [2025-03-09 02:41:41,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:41,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104266083] [2025-03-09 02:41:41,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:41,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:41,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:41:41,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:41:41,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:41,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 02:41:41,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:41,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104266083] [2025-03-09 02:41:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104266083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:41,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:41,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:41,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745754146] [2025-03-09 02:41:41,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:41,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:41,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:41,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:41,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:41,619 INFO L87 Difference]: Start difference. First operand 100 states and 128 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:41:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:41,644 INFO L93 Difference]: Finished difference Result 132 states and 178 transitions. [2025-03-09 02:41:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:41,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-03-09 02:41:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:41,646 INFO L225 Difference]: With dead ends: 132 [2025-03-09 02:41:41,646 INFO L226 Difference]: Without dead ends: 130 [2025-03-09 02:41:41,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:41,646 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:41,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 114 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:41,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-09 02:41:41,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 118. [2025-03-09 02:41:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 91 states have (on average 1.1428571428571428) internal successors, (104), 93 states have internal predecessors, (104), 16 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (34), 19 states have call predecessors, (34), 15 states have call successors, (34) [2025-03-09 02:41:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 154 transitions. [2025-03-09 02:41:41,661 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 154 transitions. Word has length 31 [2025-03-09 02:41:41,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:41,661 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 154 transitions. [2025-03-09 02:41:41,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:41:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 154 transitions. [2025-03-09 02:41:41,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 02:41:41,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:41,662 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:41,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 02:41:41,662 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:41,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:41,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1904404842, now seen corresponding path program 1 times [2025-03-09 02:41:41,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:41,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642433854] [2025-03-09 02:41:41,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:41,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:41,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 02:41:41,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:41:41,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:41,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 02:41:41,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:41,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642433854] [2025-03-09 02:41:41,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642433854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:41,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667712765] [2025-03-09 02:41:41,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:41,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:41,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:41,734 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:41,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:41:41,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 02:41:41,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:41:41,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:41,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:41,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:41:41,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 02:41:41,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 02:41:41,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667712765] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:41,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:41,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-03-09 02:41:41,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14387534] [2025-03-09 02:41:41,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:41,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:41:41,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:41,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:41:41,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:41:41,843 INFO L87 Difference]: Start difference. First operand 118 states and 154 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-09 02:41:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:41,917 INFO L93 Difference]: Finished difference Result 137 states and 182 transitions. [2025-03-09 02:41:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:41:41,918 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2025-03-09 02:41:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:41,919 INFO L225 Difference]: With dead ends: 137 [2025-03-09 02:41:41,919 INFO L226 Difference]: Without dead ends: 135 [2025-03-09 02:41:41,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:41:41,919 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 11 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:41,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 366 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-09 02:41:41,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 122. [2025-03-09 02:41:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 96 states have internal predecessors, (107), 16 states have call successors, (16), 5 states have call predecessors, (16), 8 states have return successors, (37), 20 states have call predecessors, (37), 15 states have call successors, (37) [2025-03-09 02:41:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 160 transitions. [2025-03-09 02:41:41,927 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 160 transitions. Word has length 36 [2025-03-09 02:41:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:41,928 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 160 transitions. [2025-03-09 02:41:41,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-09 02:41:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 160 transitions. [2025-03-09 02:41:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 02:41:41,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:41,930 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:41,935 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:41:42,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:42,131 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:42,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:42,131 INFO L85 PathProgramCache]: Analyzing trace with hash -708842864, now seen corresponding path program 1 times [2025-03-09 02:41:42,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:42,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735190931] [2025-03-09 02:41:42,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:42,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:42,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:41:42,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:41:42,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:42,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-09 02:41:42,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:42,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735190931] [2025-03-09 02:41:42,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735190931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:42,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889921514] [2025-03-09 02:41:42,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:42,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:42,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:42,189 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:42,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:41:42,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:41:42,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:41:42,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:42,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:42,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:41:42,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:41:42,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:41:42,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889921514] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:42,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:42,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 14 [2025-03-09 02:41:42,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890734024] [2025-03-09 02:41:42,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:42,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 02:41:42,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:42,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 02:41:42,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:41:42,410 INFO L87 Difference]: Start difference. First operand 122 states and 160 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 02:41:42,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:42,622 INFO L93 Difference]: Finished difference Result 235 states and 306 transitions. [2025-03-09 02:41:42,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:41:42,623 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 46 [2025-03-09 02:41:42,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:42,624 INFO L225 Difference]: With dead ends: 235 [2025-03-09 02:41:42,624 INFO L226 Difference]: Without dead ends: 132 [2025-03-09 02:41:42,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:41:42,625 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 62 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:42,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 424 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:41:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-09 02:41:42,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 119. [2025-03-09 02:41:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 91 states have (on average 1.1428571428571428) internal successors, (104), 94 states have internal predecessors, (104), 16 states have call successors, (16), 5 states have call predecessors, (16), 8 states have return successors, (37), 19 states have call predecessors, (37), 15 states have call successors, (37) [2025-03-09 02:41:42,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 157 transitions. [2025-03-09 02:41:42,640 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 157 transitions. Word has length 46 [2025-03-09 02:41:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:42,640 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 157 transitions. [2025-03-09 02:41:42,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 02:41:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 157 transitions. [2025-03-09 02:41:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 02:41:42,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:42,641 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:42,648 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:41:42,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:42,847 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:42,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash -535934519, now seen corresponding path program 1 times [2025-03-09 02:41:42,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:42,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176457910] [2025-03-09 02:41:42,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:42,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:42,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 02:41:42,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 02:41:42,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:42,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 02:41:42,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:42,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176457910] [2025-03-09 02:41:42,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176457910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:42,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:42,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:42,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286542844] [2025-03-09 02:41:42,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:42,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:42,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:42,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:42,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:42,898 INFO L87 Difference]: Start difference. First operand 119 states and 157 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:41:42,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:42,927 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2025-03-09 02:41:42,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:42,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2025-03-09 02:41:42,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:42,928 INFO L225 Difference]: With dead ends: 129 [2025-03-09 02:41:42,928 INFO L226 Difference]: Without dead ends: 128 [2025-03-09 02:41:42,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:42,929 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:42,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 182 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:42,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-09 02:41:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2025-03-09 02:41:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 89 states have internal predecessors, (100), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (31), 18 states have call predecessors, (31), 14 states have call successors, (31) [2025-03-09 02:41:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2025-03-09 02:41:42,941 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 38 [2025-03-09 02:41:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:42,941 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2025-03-09 02:41:42,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:41:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2025-03-09 02:41:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 02:41:42,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:42,942 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:42,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 02:41:42,942 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:42,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:42,942 INFO L85 PathProgramCache]: Analyzing trace with hash -2027301652, now seen corresponding path program 1 times [2025-03-09 02:41:42,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:42,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450248478] [2025-03-09 02:41:42,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:42,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:42,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 02:41:42,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 02:41:42,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:42,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:41:43,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:43,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450248478] [2025-03-09 02:41:43,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450248478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:43,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331070278] [2025-03-09 02:41:43,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:43,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:43,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:43,005 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:43,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:41:43,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 02:41:43,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 02:41:43,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:43,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:43,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:41:43,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:43,128 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:41:43,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:41:43,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331070278] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:43,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:43,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 16 [2025-03-09 02:41:43,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434386774] [2025-03-09 02:41:43,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:43,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 02:41:43,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:43,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 02:41:43,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:41:43,237 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 13 states have internal predecessors, (68), 7 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 02:41:43,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:43,492 INFO L93 Difference]: Finished difference Result 258 states and 340 transitions. [2025-03-09 02:41:43,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 02:41:43,493 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 13 states have internal predecessors, (68), 7 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2025-03-09 02:41:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:43,494 INFO L225 Difference]: With dead ends: 258 [2025-03-09 02:41:43,494 INFO L226 Difference]: Without dead ends: 160 [2025-03-09 02:41:43,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 84 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:41:43,497 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 95 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:43,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 427 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:41:43,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-09 02:41:43,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2025-03-09 02:41:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 105 states have (on average 1.1428571428571428) internal successors, (120), 106 states have internal predecessors, (120), 17 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (39), 22 states have call predecessors, (39), 16 states have call successors, (39) [2025-03-09 02:41:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2025-03-09 02:41:43,508 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 50 [2025-03-09 02:41:43,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:43,508 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2025-03-09 02:41:43,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 13 states have internal predecessors, (68), 7 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 02:41:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2025-03-09 02:41:43,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 02:41:43,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:43,510 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:43,520 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:41:43,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-09 02:41:43,710 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:43,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:43,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1453250303, now seen corresponding path program 1 times [2025-03-09 02:41:43,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:43,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590593072] [2025-03-09 02:41:43,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:43,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:43,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:41:43,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:41:43,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:43,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:41:43,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:43,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590593072] [2025-03-09 02:41:43,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590593072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:43,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330689154] [2025-03-09 02:41:43,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:43,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:43,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:43,808 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:43,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:41:43,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:41:43,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:41:43,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:43,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:43,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:41:43,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:41:43,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:41:43,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330689154] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:43,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:43,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 12 [2025-03-09 02:41:43,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353832246] [2025-03-09 02:41:43,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:43,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:41:43,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:43,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:41:43,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:41:43,995 INFO L87 Difference]: Start difference. First operand 135 states and 176 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:41:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:44,127 INFO L93 Difference]: Finished difference Result 243 states and 332 transitions. [2025-03-09 02:41:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 02:41:44,127 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2025-03-09 02:41:44,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:44,128 INFO L225 Difference]: With dead ends: 243 [2025-03-09 02:41:44,128 INFO L226 Difference]: Without dead ends: 133 [2025-03-09 02:41:44,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 108 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-09 02:41:44,129 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 88 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:44,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 165 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-09 02:41:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2025-03-09 02:41:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 101 states have (on average 1.1485148514851484) internal successors, (116), 104 states have internal predecessors, (116), 17 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (31), 20 states have call predecessors, (31), 16 states have call successors, (31) [2025-03-09 02:41:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2025-03-09 02:41:44,136 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 57 [2025-03-09 02:41:44,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:44,136 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2025-03-09 02:41:44,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:41:44,136 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2025-03-09 02:41:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 02:41:44,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:44,137 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:44,143 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:41:44,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:44,338 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:44,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:44,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1878827636, now seen corresponding path program 1 times [2025-03-09 02:41:44,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:44,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387199807] [2025-03-09 02:41:44,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:44,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:44,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 02:41:44,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 02:41:44,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:44,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 02:41:44,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:44,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387199807] [2025-03-09 02:41:44,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387199807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:44,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:44,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:44,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650783885] [2025-03-09 02:41:44,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:44,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:44,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:44,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:44,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:44,390 INFO L87 Difference]: Start difference. First operand 131 states and 164 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:41:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:44,411 INFO L93 Difference]: Finished difference Result 148 states and 186 transitions. [2025-03-09 02:41:44,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:44,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2025-03-09 02:41:44,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:44,412 INFO L225 Difference]: With dead ends: 148 [2025-03-09 02:41:44,412 INFO L226 Difference]: Without dead ends: 147 [2025-03-09 02:41:44,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:44,412 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:44,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 117 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:44,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-09 02:41:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2025-03-09 02:41:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 107 states have internal predecessors, (122), 17 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (31), 23 states have call predecessors, (31), 16 states have call successors, (31) [2025-03-09 02:41:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2025-03-09 02:41:44,418 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 50 [2025-03-09 02:41:44,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:44,418 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2025-03-09 02:41:44,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:41:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2025-03-09 02:41:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 02:41:44,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:44,419 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:44,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 02:41:44,419 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:44,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:44,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1885885413, now seen corresponding path program 1 times [2025-03-09 02:41:44,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:44,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835023896] [2025-03-09 02:41:44,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:44,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:44,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 02:41:44,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 02:41:44,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:44,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-09 02:41:44,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:44,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835023896] [2025-03-09 02:41:44,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835023896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:44,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462903555] [2025-03-09 02:41:44,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:44,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:44,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:44,496 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:44,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 02:41:44,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 02:41:44,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 02:41:44,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:44,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:44,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:41:44,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 02:41:44,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:41:44,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462903555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:44,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:41:44,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2025-03-09 02:41:44,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242720759] [2025-03-09 02:41:44,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:44,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:41:44,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:44,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:41:44,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:41:44,589 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:41:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:44,633 INFO L93 Difference]: Finished difference Result 178 states and 239 transitions. [2025-03-09 02:41:44,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:41:44,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 51 [2025-03-09 02:41:44,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:44,635 INFO L225 Difference]: With dead ends: 178 [2025-03-09 02:41:44,635 INFO L226 Difference]: Without dead ends: 177 [2025-03-09 02:41:44,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:41:44,635 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:44,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 202 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-09 02:41:44,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 162. [2025-03-09 02:41:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 127 states have (on average 1.141732283464567) internal successors, (145), 125 states have internal predecessors, (145), 20 states have call successors, (20), 6 states have call predecessors, (20), 11 states have return successors, (50), 30 states have call predecessors, (50), 19 states have call successors, (50) [2025-03-09 02:41:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 215 transitions. [2025-03-09 02:41:44,642 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 215 transitions. Word has length 51 [2025-03-09 02:41:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:44,642 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 215 transitions. [2025-03-09 02:41:44,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:41:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 215 transitions. [2025-03-09 02:41:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 02:41:44,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:44,643 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:44,648 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:41:44,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:44,844 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:44,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:44,844 INFO L85 PathProgramCache]: Analyzing trace with hash -27100141, now seen corresponding path program 1 times [2025-03-09 02:41:44,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:44,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944620986] [2025-03-09 02:41:44,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:44,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:44,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:41:44,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:41:44,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:44,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 02:41:44,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:44,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944620986] [2025-03-09 02:41:44,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944620986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:44,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051517470] [2025-03-09 02:41:44,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:44,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:44,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:44,890 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:44,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:41:44,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:41:44,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:41:44,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:44,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:44,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:41:44,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:41:45,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:41:45,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051517470] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:45,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:45,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11, 11] total 14 [2025-03-09 02:41:45,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457234170] [2025-03-09 02:41:45,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:45,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 02:41:45,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:45,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 02:41:45,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:41:45,127 INFO L87 Difference]: Start difference. First operand 162 states and 215 transitions. Second operand has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 10 states have internal predecessors, (75), 7 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-09 02:41:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:45,334 INFO L93 Difference]: Finished difference Result 247 states and 324 transitions. [2025-03-09 02:41:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:41:45,335 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 10 states have internal predecessors, (75), 7 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 69 [2025-03-09 02:41:45,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:45,336 INFO L225 Difference]: With dead ends: 247 [2025-03-09 02:41:45,336 INFO L226 Difference]: Without dead ends: 181 [2025-03-09 02:41:45,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 122 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:41:45,337 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 89 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:45,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 228 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:41:45,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-09 02:41:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 170. [2025-03-09 02:41:45,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 133 states have (on average 1.1353383458646618) internal successors, (151), 131 states have internal predecessors, (151), 21 states have call successors, (21), 7 states have call predecessors, (21), 12 states have return successors, (54), 31 states have call predecessors, (54), 20 states have call successors, (54) [2025-03-09 02:41:45,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 226 transitions. [2025-03-09 02:41:45,344 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 226 transitions. Word has length 69 [2025-03-09 02:41:45,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:45,344 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 226 transitions. [2025-03-09 02:41:45,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 10 states have internal predecessors, (75), 7 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-09 02:41:45,345 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 226 transitions. [2025-03-09 02:41:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-09 02:41:45,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:45,345 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:45,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:45,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 02:41:45,546 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:45,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:45,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1387055124, now seen corresponding path program 1 times [2025-03-09 02:41:45,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:45,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540154756] [2025-03-09 02:41:45,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:45,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:45,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 02:41:45,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 02:41:45,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:45,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:41:45,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:45,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540154756] [2025-03-09 02:41:45,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540154756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:45,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:45,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:45,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928144065] [2025-03-09 02:41:45,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:45,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:45,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:45,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:45,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:45,580 INFO L87 Difference]: Start difference. First operand 170 states and 226 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:41:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:45,600 INFO L93 Difference]: Finished difference Result 172 states and 227 transitions. [2025-03-09 02:41:45,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:45,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2025-03-09 02:41:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:45,601 INFO L225 Difference]: With dead ends: 172 [2025-03-09 02:41:45,601 INFO L226 Difference]: Without dead ends: 171 [2025-03-09 02:41:45,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:45,602 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:45,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 111 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-09 02:41:45,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2025-03-09 02:41:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 133 states have (on average 1.1203007518796992) internal successors, (149), 131 states have internal predecessors, (149), 21 states have call successors, (21), 7 states have call predecessors, (21), 12 states have return successors, (54), 31 states have call predecessors, (54), 20 states have call successors, (54) [2025-03-09 02:41:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 224 transitions. [2025-03-09 02:41:45,609 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 224 transitions. Word has length 54 [2025-03-09 02:41:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:45,609 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 224 transitions. [2025-03-09 02:41:45,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:41:45,609 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 224 transitions. [2025-03-09 02:41:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-09 02:41:45,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:45,609 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:45,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 02:41:45,610 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:45,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:45,610 INFO L85 PathProgramCache]: Analyzing trace with hash -440515929, now seen corresponding path program 1 times [2025-03-09 02:41:45,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:45,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145585933] [2025-03-09 02:41:45,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:45,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:45,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-09 02:41:45,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 02:41:45,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:45,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-09 02:41:45,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:45,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145585933] [2025-03-09 02:41:45,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145585933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:45,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335846483] [2025-03-09 02:41:45,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:45,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:45,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:45,650 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:45,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 02:41:45,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-09 02:41:45,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 02:41:45,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:45,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:45,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 02:41:45,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:41:45,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:41:45,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335846483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:45,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:41:45,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2025-03-09 02:41:45,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163282222] [2025-03-09 02:41:45,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:45,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:41:45,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:45,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:41:45,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:41:45,795 INFO L87 Difference]: Start difference. First operand 170 states and 224 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 8 states have internal predecessors, (49), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:41:45,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:45,969 INFO L93 Difference]: Finished difference Result 287 states and 381 transitions. [2025-03-09 02:41:45,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:41:45,969 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 8 states have internal predecessors, (49), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 73 [2025-03-09 02:41:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:45,970 INFO L225 Difference]: With dead ends: 287 [2025-03-09 02:41:45,970 INFO L226 Difference]: Without dead ends: 156 [2025-03-09 02:41:45,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:41:45,971 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 109 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:45,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 228 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-09 02:41:45,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2025-03-09 02:41:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 120 states have (on average 1.1083333333333334) internal successors, (133), 121 states have internal predecessors, (133), 18 states have call successors, (18), 8 states have call predecessors, (18), 13 states have return successors, (36), 25 states have call predecessors, (36), 17 states have call successors, (36) [2025-03-09 02:41:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 187 transitions. [2025-03-09 02:41:45,978 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 187 transitions. Word has length 73 [2025-03-09 02:41:45,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:45,978 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 187 transitions. [2025-03-09 02:41:45,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 8 states have internal predecessors, (49), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:41:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 187 transitions. [2025-03-09 02:41:45,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 02:41:45,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:45,979 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:45,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 02:41:46,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:46,180 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:46,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:46,180 INFO L85 PathProgramCache]: Analyzing trace with hash 49035892, now seen corresponding path program 1 times [2025-03-09 02:41:46,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:46,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537291620] [2025-03-09 02:41:46,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:46,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:46,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 02:41:46,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 02:41:46,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:46,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:41:46,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:46,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537291620] [2025-03-09 02:41:46,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537291620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:46,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:46,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:46,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963158272] [2025-03-09 02:41:46,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:46,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:46,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:46,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:46,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:46,211 INFO L87 Difference]: Start difference. First operand 155 states and 187 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:41:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:46,231 INFO L93 Difference]: Finished difference Result 157 states and 188 transitions. [2025-03-09 02:41:46,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:46,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2025-03-09 02:41:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:46,232 INFO L225 Difference]: With dead ends: 157 [2025-03-09 02:41:46,232 INFO L226 Difference]: Without dead ends: 156 [2025-03-09 02:41:46,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:46,233 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:46,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 145 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:46,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-09 02:41:46,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2025-03-09 02:41:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 120 states have (on average 1.0916666666666666) internal successors, (131), 121 states have internal predecessors, (131), 18 states have call successors, (18), 8 states have call predecessors, (18), 13 states have return successors, (36), 25 states have call predecessors, (36), 17 states have call successors, (36) [2025-03-09 02:41:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 185 transitions. [2025-03-09 02:41:46,239 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 185 transitions. Word has length 55 [2025-03-09 02:41:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:46,240 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 185 transitions. [2025-03-09 02:41:46,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:41:46,240 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 185 transitions. [2025-03-09 02:41:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-09 02:41:46,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:46,240 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:46,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 02:41:46,240 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:46,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:46,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1361290470, now seen corresponding path program 1 times [2025-03-09 02:41:46,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:46,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868463879] [2025-03-09 02:41:46,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:46,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:46,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 02:41:46,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 02:41:46,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:46,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 02:41:46,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:46,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868463879] [2025-03-09 02:41:46,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868463879] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:46,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118981953] [2025-03-09 02:41:46,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:46,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:46,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:46,364 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:46,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 02:41:46,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 02:41:46,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 02:41:46,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:46,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:46,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:41:46,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-09 02:41:46,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-09 02:41:46,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118981953] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:46,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:46,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 23 [2025-03-09 02:41:46,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796527898] [2025-03-09 02:41:46,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:46,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 02:41:46,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:46,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 02:41:46,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2025-03-09 02:41:46,683 INFO L87 Difference]: Start difference. First operand 155 states and 185 transitions. Second operand has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 21 states have internal predecessors, (79), 9 states have call successors, (14), 3 states have call predecessors, (14), 6 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-09 02:41:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:47,132 INFO L93 Difference]: Finished difference Result 273 states and 334 transitions. [2025-03-09 02:41:47,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 02:41:47,132 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 21 states have internal predecessors, (79), 9 states have call successors, (14), 3 states have call predecessors, (14), 6 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) Word has length 68 [2025-03-09 02:41:47,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:47,133 INFO L225 Difference]: With dead ends: 273 [2025-03-09 02:41:47,133 INFO L226 Difference]: Without dead ends: 169 [2025-03-09 02:41:47,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=1490, Unknown=0, NotChecked=0, Total=1722 [2025-03-09 02:41:47,135 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 106 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:47,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 252 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:41:47,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-09 02:41:47,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2025-03-09 02:41:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 111 states have (on average 1.072072072072072) internal successors, (119), 115 states have internal predecessors, (119), 17 states have call successors, (17), 8 states have call predecessors, (17), 13 states have return successors, (24), 21 states have call predecessors, (24), 16 states have call successors, (24) [2025-03-09 02:41:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 160 transitions. [2025-03-09 02:41:47,141 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 160 transitions. Word has length 68 [2025-03-09 02:41:47,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:47,141 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 160 transitions. [2025-03-09 02:41:47,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 21 states have internal predecessors, (79), 9 states have call successors, (14), 3 states have call predecessors, (14), 6 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-09 02:41:47,141 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 160 transitions. [2025-03-09 02:41:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 02:41:47,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:47,142 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:47,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:47,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-09 02:41:47,343 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:47,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:47,343 INFO L85 PathProgramCache]: Analyzing trace with hash -930367833, now seen corresponding path program 1 times [2025-03-09 02:41:47,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:47,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98638792] [2025-03-09 02:41:47,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:47,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:47,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:41:47,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:41:47,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:47,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:41:47,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:47,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98638792] [2025-03-09 02:41:47,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98638792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:47,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152691588] [2025-03-09 02:41:47,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:47,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:47,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:47,464 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:47,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 02:41:47,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:41:47,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:41:47,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:47,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:47,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 02:41:47,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-09 02:41:47,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-09 02:41:47,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152691588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:47,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:47,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 11] total 28 [2025-03-09 02:41:47,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434297073] [2025-03-09 02:41:47,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:47,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 02:41:47,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:47,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 02:41:47,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2025-03-09 02:41:47,975 INFO L87 Difference]: Start difference. First operand 145 states and 160 transitions. Second operand has 28 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 states have internal predecessors, (97), 12 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 14 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-09 02:41:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:48,583 INFO L93 Difference]: Finished difference Result 252 states and 277 transitions. [2025-03-09 02:41:48,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-09 02:41:48,586 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 states have internal predecessors, (97), 12 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 14 states have call predecessors, (16), 10 states have call successors, (16) Word has length 69 [2025-03-09 02:41:48,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:48,587 INFO L225 Difference]: With dead ends: 252 [2025-03-09 02:41:48,587 INFO L226 Difference]: Without dead ends: 119 [2025-03-09 02:41:48,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=360, Invalid=2502, Unknown=0, NotChecked=0, Total=2862 [2025-03-09 02:41:48,589 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 98 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:48,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 284 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:41:48,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-09 02:41:48,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 93. [2025-03-09 02:41:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.056338028169014) internal successors, (75), 75 states have internal predecessors, (75), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-09 02:41:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2025-03-09 02:41:48,597 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 69 [2025-03-09 02:41:48,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:48,597 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2025-03-09 02:41:48,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 states have internal predecessors, (97), 12 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 14 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-09 02:41:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2025-03-09 02:41:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-09 02:41:48,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:48,598 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:48,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:48,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 02:41:48,798 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:48,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash -978284185, now seen corresponding path program 1 times [2025-03-09 02:41:48,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:48,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539284758] [2025-03-09 02:41:48,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:48,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:48,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-09 02:41:48,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-09 02:41:48,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:48,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-09 02:41:48,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:48,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539284758] [2025-03-09 02:41:48,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539284758] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:48,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963116463] [2025-03-09 02:41:48,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:48,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:48,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:49,001 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:49,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 02:41:49,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-09 02:41:49,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-09 02:41:49,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:49,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:49,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 02:41:49,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-09 02:41:49,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-09 02:41:49,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963116463] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:49,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:49,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 15] total 33 [2025-03-09 02:41:49,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972420996] [2025-03-09 02:41:49,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:49,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-09 02:41:49,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:49,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-09 02:41:49,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 02:41:49,600 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 9 states have call successors, (11), 1 states have call predecessors, (11), 13 states have return successors, (19), 18 states have call predecessors, (19), 9 states have call successors, (19) [2025-03-09 02:41:49,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:49,790 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2025-03-09 02:41:49,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 02:41:49,790 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 9 states have call successors, (11), 1 states have call predecessors, (11), 13 states have return successors, (19), 18 states have call predecessors, (19), 9 states have call successors, (19) Word has length 83 [2025-03-09 02:41:49,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:49,791 INFO L225 Difference]: With dead ends: 127 [2025-03-09 02:41:49,791 INFO L226 Difference]: Without dead ends: 126 [2025-03-09 02:41:49,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=1354, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 02:41:49,792 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:49,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 543 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:49,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-09 02:41:49,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2025-03-09 02:41:49,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 74 states have internal predecessors, (74), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-09 02:41:49,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2025-03-09 02:41:49,798 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 83 [2025-03-09 02:41:49,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:49,798 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2025-03-09 02:41:49,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 9 states have call successors, (11), 1 states have call predecessors, (11), 13 states have return successors, (19), 18 states have call predecessors, (19), 9 states have call successors, (19) [2025-03-09 02:41:49,798 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2025-03-09 02:41:49,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-09 02:41:49,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:49,799 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:49,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:50,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-09 02:41:50,003 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 02:41:50,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:50,003 INFO L85 PathProgramCache]: Analyzing trace with hash -262038655, now seen corresponding path program 1 times [2025-03-09 02:41:50,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:50,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508945376] [2025-03-09 02:41:50,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:50,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:50,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-09 02:41:50,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 02:41:50,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:50,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:50,165 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-09 02:41:50,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:50,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508945376] [2025-03-09 02:41:50,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508945376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:50,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230716010] [2025-03-09 02:41:50,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:50,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:50,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:50,167 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:50,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 02:41:50,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-09 02:41:50,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 02:41:50,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:50,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:50,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 02:41:50,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-09 02:41:50,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-09 02:41:50,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230716010] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:50,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:50,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 16] total 33 [2025-03-09 02:41:50,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676354306] [2025-03-09 02:41:50,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:50,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-09 02:41:50,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:50,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-09 02:41:50,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 02:41:50,721 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 34 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 34 states have internal predecessors, (93), 9 states have call successors, (11), 1 states have call predecessors, (11), 12 states have return successors, (20), 20 states have call predecessors, (20), 9 states have call successors, (20) [2025-03-09 02:41:50,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:50,820 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2025-03-09 02:41:50,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 02:41:50,820 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 34 states have internal predecessors, (93), 9 states have call successors, (11), 1 states have call predecessors, (11), 12 states have return successors, (20), 20 states have call predecessors, (20), 9 states have call successors, (20) Word has length 84 [2025-03-09 02:41:50,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:50,821 INFO L225 Difference]: With dead ends: 121 [2025-03-09 02:41:50,821 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:41:50,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 145 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=1090, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 02:41:50,822 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:50,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 429 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:50,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:41:50,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:41:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:41:50,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2025-03-09 02:41:50,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:50,822 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:41:50,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 34 states have internal predecessors, (93), 9 states have call successors, (11), 1 states have call predecessors, (11), 12 states have return successors, (20), 20 states have call predecessors, (20), 9 states have call successors, (20) [2025-03-09 02:41:50,822 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:41:50,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:41:50,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-09 02:41:50,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-09 02:41:50,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-09 02:41:50,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-09 02:41:50,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-09 02:41:50,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-09 02:41:50,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-09 02:41:50,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-09 02:41:50,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-09 02:41:50,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-09 02:41:50,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-09 02:41:50,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-09 02:41:50,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:51,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 02:41:51,030 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:51,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:41:51,853 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:41:51,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:41:51 BoogieIcfgContainer [2025-03-09 02:41:51,857 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:41:51,858 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:41:51,858 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:41:51,858 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:41:51,858 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:41:39" (3/4) ... [2025-03-09 02:41:51,860 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:41:51,864 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibo2 [2025-03-09 02:41:51,864 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibo1 [2025-03-09 02:41:51,867 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 02:41:51,867 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:41:51,867 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:41:51,867 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:41:51,919 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:41:51,919 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:41:51,919 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:41:51,920 INFO L158 Benchmark]: Toolchain (without parser) took 13053.45ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 134.6MB in the beginning and 242.6MB in the end (delta: -108.0MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2025-03-09 02:41:51,920 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:41:51,921 INFO L158 Benchmark]: CACSL2BoogieTranslator took 123.77ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 124.0MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:41:51,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.25ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 123.1MB in the end (delta: 891.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:41:51,921 INFO L158 Benchmark]: Boogie Preprocessor took 26.18ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 121.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:41:51,921 INFO L158 Benchmark]: IcfgBuilder took 243.37ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 109.2MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:41:51,921 INFO L158 Benchmark]: TraceAbstraction took 12573.03ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 108.7MB in the beginning and 249.4MB in the end (delta: -140.7MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. [2025-03-09 02:41:51,921 INFO L158 Benchmark]: Witness Printer took 61.91ms. Allocated memory is still 310.4MB. Free memory was 249.4MB in the beginning and 242.6MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:41:51,922 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.85ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 123.77ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 124.0MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.25ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 123.1MB in the end (delta: 891.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.18ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 121.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 243.37ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 109.2MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12573.03ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 108.7MB in the beginning and 249.4MB in the end (delta: -140.7MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. * Witness Printer took 61.91ms. Allocated memory is still 310.4MB. Free memory was 249.4MB in the beginning and 242.6MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 53 locations, 65 edges, 12 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 987 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 949 mSDsluCounter, 5550 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4667 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4631 IncrementalHoareTripleChecker+Invalid, 4900 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 883 mSDtfsCounter, 4631 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1581 GetRequests, 1191 SyntacticMatches, 48 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=17, InterpolantAutomatonStates: 260, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 238 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1802 NumberOfCodeBlocks, 1802 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2347 ConstructedInterpolants, 0 QuantifiedInterpolants, 4956 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1625 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 47 InterpolantComputations, 14 PerfectInterpolantSequences, 1340/1716 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 02:41:51,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE