./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/fibo_5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_5-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 02dc726982da9e300f34803a4bdbb3c0165037d3f4471bd0e009c42cfb19ed24 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:29:35,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:29:35,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:29:35,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:29:35,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:29:35,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:29:35,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:29:35,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:29:35,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:29:35,412 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:29:35,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:29:35,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:29:35,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:29:35,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:29:35,414 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:29:35,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:29:35,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:29:35,414 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:29:35,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:29:35,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:29:35,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:29:35,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:29:35,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:29:35,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:29:35,415 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:29:35,415 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:29:35,415 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:29:35,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:29:35,415 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:29:35,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:29:35,415 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:29:35,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:29:35,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:29:35,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:29:35,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:29:35,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:29:35,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:29:35,416 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:29:35,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:29:35,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:29:35,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:29:35,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:29:35,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:29:35,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:29:35,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:29:35,417 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 -> 02dc726982da9e300f34803a4bdbb3c0165037d3f4471bd0e009c42cfb19ed24 [2025-03-04 11:29:35,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:29:35,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:29:35,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:29:35,630 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:29:35,631 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:29:35,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_5-2.c [2025-03-04 11:29:36,819 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a61f6a1ce/85ebed82aed54cb48d07729633b30913/FLAG5d63c9b06 [2025-03-04 11:29:37,009 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:29:37,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_5-2.c [2025-03-04 11:29:37,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a61f6a1ce/85ebed82aed54cb48d07729633b30913/FLAG5d63c9b06 [2025-03-04 11:29:37,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a61f6a1ce/85ebed82aed54cb48d07729633b30913 [2025-03-04 11:29:37,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:29:37,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:29:37,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:29:37,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:29:37,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:29:37,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:29:37" (1/1) ... [2025-03-04 11:29:37,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42456090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:37, skipping insertion in model container [2025-03-04 11:29:37,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:29:37" (1/1) ... [2025-03-04 11:29:37,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:29:37,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:29:37,152 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:29:37,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:29:37,173 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:29:37,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:37 WrapperNode [2025-03-04 11:29:37,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:29:37,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:29:37,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:29:37,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:29:37,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:37" (1/1) ... [2025-03-04 11:29:37,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:37" (1/1) ... [2025-03-04 11:29:37,192 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2025-03-04 11:29:37,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:29:37,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:29:37,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:29:37,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:29:37,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:37" (1/1) ... [2025-03-04 11:29:37,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:37" (1/1) ... [2025-03-04 11:29:37,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:37" (1/1) ... [2025-03-04 11:29:37,211 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:29:37,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:37" (1/1) ... [2025-03-04 11:29:37,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:37" (1/1) ... [2025-03-04 11:29:37,212 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:37" (1/1) ... [2025-03-04 11:29:37,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:37" (1/1) ... [2025-03-04 11:29:37,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:37" (1/1) ... [2025-03-04 11:29:37,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:37" (1/1) ... [2025-03-04 11:29:37,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:29:37,218 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:29:37,218 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:29:37,218 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:29:37,219 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:37" (1/1) ... [2025-03-04 11:29:37,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:29:37,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:37,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:29:37,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:29:37,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:29:37,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:29:37,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:29:37,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:29:37,269 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2025-03-04 11:29:37,270 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2025-03-04 11:29:37,306 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:29:37,308 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:29:37,407 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: havoc #t~ret4;havoc #t~ret5; [2025-03-04 11:29:37,416 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 11:29:37,417 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:29:37,427 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:29:37,428 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:29:37,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:29:37 BoogieIcfgContainer [2025-03-04 11:29:37,428 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:29:37,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:29:37,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:29:37,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:29:37,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:29:37" (1/3) ... [2025-03-04 11:29:37,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba7d254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:29:37, skipping insertion in model container [2025-03-04 11:29:37,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:29:37" (2/3) ... [2025-03-04 11:29:37,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba7d254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:29:37, skipping insertion in model container [2025-03-04 11:29:37,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:29:37" (3/3) ... [2025-03-04 11:29:37,435 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_5-2.c [2025-03-04 11:29:37,445 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:29:37,446 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_5-2.c that has 2 procedures, 32 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-04 11:29:37,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:29:37,490 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;@207bc118, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:29:37,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 11:29:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:29:37,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:29:37,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:37,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:37,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:37,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:37,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1976054303, now seen corresponding path program 1 times [2025-03-04 11:29:37,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:37,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591875982] [2025-03-04 11:29:37,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:37,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:37,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:29:37,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:29:37,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:37,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:29:37,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:37,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591875982] [2025-03-04 11:29:37,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591875982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:37,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:37,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:29:37,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621939357] [2025-03-04 11:29:37,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:37,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:29:37,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:37,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:29:37,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:29:37,660 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:37,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:37,698 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-04 11:29:37,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:29:37,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 11:29:37,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:37,704 INFO L225 Difference]: With dead ends: 38 [2025-03-04 11:29:37,705 INFO L226 Difference]: Without dead ends: 24 [2025-03-04 11:29:37,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:29:37,708 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:37,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-04 11:29:37,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-04 11:29:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-04 11:29:37,738 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2025-03-04 11:29:37,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:37,739 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-04 11:29:37,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-04 11:29:37,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:29:37,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:37,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:37,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:29:37,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:37,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:37,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1128141252, now seen corresponding path program 1 times [2025-03-04 11:29:37,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:37,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462353500] [2025-03-04 11:29:37,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:37,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:37,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:29:37,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:29:37,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:37,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:29:37,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:37,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462353500] [2025-03-04 11:29:37,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462353500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:37,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:37,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:37,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033363908] [2025-03-04 11:29:37,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:37,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:37,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:37,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:37,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:37,820 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:37,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:37,881 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-03-04 11:29:37,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:37,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 11:29:37,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:37,882 INFO L225 Difference]: With dead ends: 24 [2025-03-04 11:29:37,882 INFO L226 Difference]: Without dead ends: 22 [2025-03-04 11:29:37,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:29:37,883 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:37,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-04 11:29:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-03-04 11:29:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-04 11:29:37,890 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 8 [2025-03-04 11:29:37,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:37,890 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-04 11:29:37,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-04 11:29:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 11:29:37,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:37,891 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:37,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:29:37,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:37,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:37,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2023302297, now seen corresponding path program 1 times [2025-03-04 11:29:37,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:37,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223319168] [2025-03-04 11:29:37,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:37,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:37,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 11:29:37,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 11:29:37,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:37,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:29:38,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:38,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223319168] [2025-03-04 11:29:38,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223319168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:38,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:38,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:38,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27935660] [2025-03-04 11:29:38,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:38,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:38,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:38,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:38,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:38,029 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:38,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:38,083 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2025-03-04 11:29:38,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:38,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-03-04 11:29:38,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:38,084 INFO L225 Difference]: With dead ends: 34 [2025-03-04 11:29:38,084 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 11:29:38,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:38,085 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:38,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 76 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 11:29:38,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-03-04 11:29:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:29:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-04 11:29:38,090 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 23 [2025-03-04 11:29:38,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:38,090 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-04 11:29:38,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-04 11:29:38,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:29:38,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:38,091 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:38,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:29:38,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:38,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:38,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1013164860, now seen corresponding path program 1 times [2025-03-04 11:29:38,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:38,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970883390] [2025-03-04 11:29:38,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:38,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:38,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:29:38,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:29:38,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:38,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:38,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:29:38,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:38,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970883390] [2025-03-04 11:29:38,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970883390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:38,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498360200] [2025-03-04 11:29:38,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:38,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:38,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:38,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:38,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:29:38,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:29:38,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:29:38,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:38,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:38,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:29:38,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:29:38,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:29:38,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498360200] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:38,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:38,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-04 11:29:38,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521060911] [2025-03-04 11:29:38,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:38,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:29:38,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:38,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:29:38,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:29:38,463 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 15 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:29:38,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:38,963 INFO L93 Difference]: Finished difference Result 142 states and 214 transitions. [2025-03-04 11:29:38,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:29:38,963 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 24 [2025-03-04 11:29:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:38,965 INFO L225 Difference]: With dead ends: 142 [2025-03-04 11:29:38,965 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 11:29:38,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:29:38,966 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 79 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:38,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 244 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:29:38,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 11:29:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2025-03-04 11:29:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 71 states have internal predecessors, (76), 12 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (43), 15 states have call predecessors, (43), 11 states have call successors, (43) [2025-03-04 11:29:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2025-03-04 11:29:38,988 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 24 [2025-03-04 11:29:38,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:38,988 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2025-03-04 11:29:38,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:29:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2025-03-04 11:29:38,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 11:29:38,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:38,989 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:38,996 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-04 11:29:39,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:39,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:39,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:39,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1779932149, now seen corresponding path program 2 times [2025-03-04 11:29:39,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:39,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636641759] [2025-03-04 11:29:39,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:39,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:39,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 11:29:39,206 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:29:39,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:39,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 11:29:39,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:39,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636641759] [2025-03-04 11:29:39,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636641759] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:39,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270233879] [2025-03-04 11:29:39,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:39,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:39,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:39,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:39,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:29:39,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 11:29:39,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:29:39,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:39,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:39,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:29:39,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 11:29:39,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:29:39,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270233879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:39,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:29:39,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 11:29:39,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63824793] [2025-03-04 11:29:39,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:39,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:39,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:39,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:39,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:29:39,363 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:39,386 INFO L93 Difference]: Finished difference Result 98 states and 142 transitions. [2025-03-04 11:29:39,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:39,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-03-04 11:29:39,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:39,387 INFO L225 Difference]: With dead ends: 98 [2025-03-04 11:29:39,387 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 11:29:39,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:29:39,388 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:39,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 58 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 11:29:39,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2025-03-04 11:29:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.095890410958904) internal successors, (80), 73 states have internal predecessors, (80), 12 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (43), 17 states have call predecessors, (43), 11 states have call successors, (43) [2025-03-04 11:29:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2025-03-04 11:29:39,411 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 135 transitions. Word has length 42 [2025-03-04 11:29:39,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:39,411 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 135 transitions. [2025-03-04 11:29:39,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:39,411 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 135 transitions. [2025-03-04 11:29:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 11:29:39,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:39,412 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:39,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:29:39,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:39,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:39,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:39,613 INFO L85 PathProgramCache]: Analyzing trace with hash -213800611, now seen corresponding path program 1 times [2025-03-04 11:29:39,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:39,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312253056] [2025-03-04 11:29:39,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:39,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:39,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 11:29:39,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 11:29:39,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:39,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 11:29:39,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:39,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312253056] [2025-03-04 11:29:39,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312253056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:39,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878762346] [2025-03-04 11:29:39,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:39,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:39,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:39,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:39,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:29:39,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 11:29:39,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 11:29:39,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:39,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:39,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:29:39,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:29:39,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:29:39,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878762346] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:39,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:39,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 19 [2025-03-04 11:29:39,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097025773] [2025-03-04 11:29:39,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:39,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:29:39,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:39,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:29:39,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:29:39,954 INFO L87 Difference]: Start difference. First operand 94 states and 135 transitions. Second operand has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 15 states have internal predecessors, (56), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:29:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:40,301 INFO L93 Difference]: Finished difference Result 290 states and 456 transitions. [2025-03-04 11:29:40,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:29:40,302 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 15 states have internal predecessors, (56), 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 37 [2025-03-04 11:29:40,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:40,304 INFO L225 Difference]: With dead ends: 290 [2025-03-04 11:29:40,304 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 11:29:40,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:29:40,306 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 161 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:40,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 287 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:29:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 11:29:40,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 179. [2025-03-04 11:29:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 141 states have (on average 1.0921985815602837) internal successors, (154), 139 states have internal predecessors, (154), 22 states have call successors, (22), 6 states have call predecessors, (22), 14 states have return successors, (88), 33 states have call predecessors, (88), 21 states have call successors, (88) [2025-03-04 11:29:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 264 transitions. [2025-03-04 11:29:40,336 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 264 transitions. Word has length 37 [2025-03-04 11:29:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:40,336 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 264 transitions. [2025-03-04 11:29:40,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 15 states have internal predecessors, (56), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:29:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 264 transitions. [2025-03-04 11:29:40,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 11:29:40,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:40,339 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:40,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:40,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:40,544 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:40,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:40,544 INFO L85 PathProgramCache]: Analyzing trace with hash 584664603, now seen corresponding path program 1 times [2025-03-04 11:29:40,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:40,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974475605] [2025-03-04 11:29:40,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:40,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:40,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 11:29:40,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:29:40,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:40,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-04 11:29:40,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:40,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974475605] [2025-03-04 11:29:40,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974475605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:29:40,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:29:40,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:29:40,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774872744] [2025-03-04 11:29:40,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:29:40,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:29:40,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:40,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:29:40,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:40,618 INFO L87 Difference]: Start difference. First operand 179 states and 264 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:40,651 INFO L93 Difference]: Finished difference Result 206 states and 308 transitions. [2025-03-04 11:29:40,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:29:40,651 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 44 [2025-03-04 11:29:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:40,653 INFO L225 Difference]: With dead ends: 206 [2025-03-04 11:29:40,653 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 11:29:40,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:29:40,654 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:40,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:40,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 11:29:40,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 190. [2025-03-04 11:29:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 150 states have (on average 1.0866666666666667) internal successors, (163), 147 states have internal predecessors, (163), 24 states have call successors, (24), 6 states have call predecessors, (24), 14 states have return successors, (100), 36 states have call predecessors, (100), 23 states have call successors, (100) [2025-03-04 11:29:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 287 transitions. [2025-03-04 11:29:40,704 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 287 transitions. Word has length 44 [2025-03-04 11:29:40,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:40,705 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 287 transitions. [2025-03-04 11:29:40,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:29:40,705 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 287 transitions. [2025-03-04 11:29:40,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 11:29:40,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:40,706 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:40,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:29:40,706 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:40,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:40,707 INFO L85 PathProgramCache]: Analyzing trace with hash 274549671, now seen corresponding path program 1 times [2025-03-04 11:29:40,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:40,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817516120] [2025-03-04 11:29:40,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:40,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:40,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 11:29:40,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 11:29:40,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:40,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-04 11:29:40,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:40,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817516120] [2025-03-04 11:29:40,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817516120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:40,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871893867] [2025-03-04 11:29:40,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:40,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:40,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:40,762 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:40,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:29:40,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 11:29:40,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 11:29:40,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:40,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:40,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:29:40,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 46 proven. 63 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:29:40,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 46 proven. 63 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:29:41,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871893867] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:41,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:41,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 13] total 17 [2025-03-04 11:29:41,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722549129] [2025-03-04 11:29:41,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:41,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 11:29:41,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:41,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 11:29:41,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:29:41,086 INFO L87 Difference]: Start difference. First operand 190 states and 287 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 8 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 11:29:41,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:41,339 INFO L93 Difference]: Finished difference Result 341 states and 539 transitions. [2025-03-04 11:29:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 11:29:41,339 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 8 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 62 [2025-03-04 11:29:41,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:41,341 INFO L225 Difference]: With dead ends: 341 [2025-03-04 11:29:41,341 INFO L226 Difference]: Without dead ends: 172 [2025-03-04 11:29:41,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 104 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2025-03-04 11:29:41,343 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 183 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:41,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 96 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:41,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-04 11:29:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 150. [2025-03-04 11:29:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 117 states have (on average 1.0769230769230769) internal successors, (126), 118 states have internal predecessors, (126), 19 states have call successors, (19), 6 states have call predecessors, (19), 12 states have return successors, (38), 25 states have call predecessors, (38), 18 states have call successors, (38) [2025-03-04 11:29:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 183 transitions. [2025-03-04 11:29:41,356 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 183 transitions. Word has length 62 [2025-03-04 11:29:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:41,356 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 183 transitions. [2025-03-04 11:29:41,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 8 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 11:29:41,357 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 183 transitions. [2025-03-04 11:29:41,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 11:29:41,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:41,358 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:41,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:41,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:41,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:41,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:41,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1170072933, now seen corresponding path program 1 times [2025-03-04 11:29:41,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:41,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826066322] [2025-03-04 11:29:41,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:41,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:41,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:29:41,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:29:41,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:41,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:41,672 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-04 11:29:41,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:41,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826066322] [2025-03-04 11:29:41,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826066322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:41,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397552858] [2025-03-04 11:29:41,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:29:41,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:41,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:41,674 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:41,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:29:41,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:29:41,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:29:41,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:29:41,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:41,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:29:41,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-04 11:29:41,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-04 11:29:41,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397552858] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:41,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:41,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-03-04 11:29:41,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613926795] [2025-03-04 11:29:41,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:41,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 11:29:41,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:41,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 11:29:41,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:29:41,896 INFO L87 Difference]: Start difference. First operand 150 states and 183 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:29:41,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:41,973 INFO L93 Difference]: Finished difference Result 168 states and 207 transitions. [2025-03-04 11:29:41,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:29:41,974 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) Word has length 57 [2025-03-04 11:29:41,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:41,975 INFO L225 Difference]: With dead ends: 168 [2025-03-04 11:29:41,976 INFO L226 Difference]: Without dead ends: 166 [2025-03-04 11:29:41,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:29:41,978 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:41,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 132 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:29:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-04 11:29:41,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 150. [2025-03-04 11:29:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 117 states have (on average 1.0512820512820513) internal successors, (123), 118 states have internal predecessors, (123), 19 states have call successors, (19), 6 states have call predecessors, (19), 12 states have return successors, (38), 25 states have call predecessors, (38), 18 states have call successors, (38) [2025-03-04 11:29:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2025-03-04 11:29:41,990 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 57 [2025-03-04 11:29:41,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:41,991 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2025-03-04 11:29:41,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:29:41,991 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2025-03-04 11:29:41,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 11:29:41,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:41,992 INFO L218 NwaCegarLoop]: trace histogram [9, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 11:29:42,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:42,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:42,198 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:42,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:42,201 INFO L85 PathProgramCache]: Analyzing trace with hash 354875586, now seen corresponding path program 2 times [2025-03-04 11:29:42,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:42,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307740402] [2025-03-04 11:29:42,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:42,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:42,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-03-04 11:29:42,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 11:29:42,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:42,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 51 proven. 69 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 11:29:42,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:42,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307740402] [2025-03-04 11:29:42,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307740402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:42,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855654939] [2025-03-04 11:29:42,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:42,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:42,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:42,354 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:42,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:29:42,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-03-04 11:29:42,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 11:29:42,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:42,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:42,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:29:42,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-03-04 11:29:42,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:42,624 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-04 11:29:42,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855654939] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:42,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:42,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 5] total 21 [2025-03-04 11:29:42,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920825787] [2025-03-04 11:29:42,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:42,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 11:29:42,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:42,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 11:29:42,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-03-04 11:29:42,626 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand has 21 states, 20 states have (on average 3.5) internal successors, (70), 18 states have internal predecessors, (70), 8 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-04 11:29:43,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:43,136 INFO L93 Difference]: Finished difference Result 269 states and 327 transitions. [2025-03-04 11:29:43,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 11:29:43,136 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 18 states have internal predecessors, (70), 8 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) Word has length 74 [2025-03-04 11:29:43,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:43,138 INFO L225 Difference]: With dead ends: 269 [2025-03-04 11:29:43,138 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 11:29:43,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=534, Invalid=1722, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 11:29:43,140 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 117 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:43,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 71 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:29:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 11:29:43,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 96. [2025-03-04 11:29:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 77 states have internal predecessors, (77), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2025-03-04 11:29:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2025-03-04 11:29:43,162 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 74 [2025-03-04 11:29:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:43,163 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2025-03-04 11:29:43,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 18 states have internal predecessors, (70), 8 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-04 11:29:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2025-03-04 11:29:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 11:29:43,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:43,164 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 1, 1, 1, 1] [2025-03-04 11:29:43,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:43,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:43,370 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:43,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:43,371 INFO L85 PathProgramCache]: Analyzing trace with hash -96073409, now seen corresponding path program 2 times [2025-03-04 11:29:43,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:43,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448265837] [2025-03-04 11:29:43,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:43,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:43,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-04 11:29:43,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 11:29:43,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:43,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 78 proven. 189 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2025-03-04 11:29:43,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:43,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448265837] [2025-03-04 11:29:43,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448265837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:43,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293878855] [2025-03-04 11:29:43,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:29:43,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:43,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:43,839 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:43,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:29:43,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-04 11:29:43,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 11:29:43,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:29:43,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:43,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 11:29:43,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2025-03-04 11:29:44,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 144 proven. 128 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-04 11:29:44,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293878855] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:44,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:44,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 17] total 31 [2025-03-04 11:29:44,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375853178] [2025-03-04 11:29:44,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:44,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 11:29:44,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:44,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 11:29:44,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:29:44,994 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 32 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 32 states have internal predecessors, (84), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (21), 21 states have call predecessors, (21), 8 states have call successors, (21) [2025-03-04 11:29:45,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:45,062 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2025-03-04 11:29:45,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:29:45,062 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 32 states have internal predecessors, (84), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (21), 21 states have call predecessors, (21), 8 states have call successors, (21) Word has length 143 [2025-03-04 11:29:45,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:45,063 INFO L225 Difference]: With dead ends: 128 [2025-03-04 11:29:45,063 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:29:45,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 270 SyntacticMatches, 13 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=252, Invalid=804, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 11:29:45,064 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:45,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 139 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:45,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:29:45,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:29:45,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:29:45,064 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2025-03-04 11:29:45,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:45,064 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:29:45,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 32 states have internal predecessors, (84), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (21), 21 states have call predecessors, (21), 8 states have call successors, (21) [2025-03-04 11:29:45,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:29:45,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:29:45,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-04 11:29:45,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-04 11:29:45,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-04 11:29:45,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-04 11:29:45,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-04 11:29:45,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fiboErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-04 11:29:45,073 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-04 11:29:45,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:45,274 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 11:29:45,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:29:45,889 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:29:45,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:29:45 BoogieIcfgContainer [2025-03-04 11:29:45,894 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:29:45,894 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:29:45,894 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:29:45,894 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:29:45,896 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:29:37" (3/4) ... [2025-03-04 11:29:45,897 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:29:45,901 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibo [2025-03-04 11:29:45,904 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 11:29:45,904 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:29:45,904 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:29:45,905 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:29:45,961 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:29:45,962 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:29:45,962 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:29:45,963 INFO L158 Benchmark]: Toolchain (without parser) took 8927.03ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 121.3MB in the beginning and 106.3MB in the end (delta: 15.0MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2025-03-04 11:29:45,963 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:29:45,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 138.01ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 111.1MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:29:45,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.24ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:29:45,965 INFO L158 Benchmark]: Boogie Preprocessor took 23.64ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 109.0MB in the end (delta: 822.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:29:45,965 INFO L158 Benchmark]: IcfgBuilder took 210.36ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 98.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:29:45,965 INFO L158 Benchmark]: TraceAbstraction took 8464.02ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 97.6MB in the beginning and 112.2MB in the end (delta: -14.6MB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. [2025-03-04 11:29:45,965 INFO L158 Benchmark]: Witness Printer took 67.48ms. Allocated memory is still 201.3MB. Free memory was 112.2MB in the beginning and 106.3MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:29:45,966 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 138.01ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 111.1MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.24ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.64ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 109.0MB in the end (delta: 822.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 210.36ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 98.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8464.02ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 97.6MB in the beginning and 112.2MB in the end (delta: -14.6MB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. * Witness Printer took 67.48ms. Allocated memory is still 201.3MB. Free memory was 112.2MB in the beginning and 106.3MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 614 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 593 mSDsluCounter, 1249 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 998 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2132 IncrementalHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 251 mSDtfsCounter, 2132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 986 GetRequests, 765 SyntacticMatches, 34 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1504 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=7, InterpolantAutomatonStates: 141, 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, 11 MinimizatonAttempts, 160 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 960 NumberOfCodeBlocks, 960 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1333 ConstructedInterpolants, 0 QuantifiedInterpolants, 2969 SizeOfPredicates, 10 NumberOfNonLiveVariables, 947 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 24 InterpolantComputations, 5 PerfectInterpolantSequences, 2663/3490 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 11:29:45,978 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