./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_7-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40add90db9f8d501baba3978de407d6383e788a1a5fafc7225d7676b58d18c84 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:22:20,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:22:20,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:22:20,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:22:20,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:22:20,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:22:20,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:22:20,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:22:20,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:22:20,429 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:22:20,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:22:20,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:22:20,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:22:20,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:22:20,431 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:22:20,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:22:20,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:22:20,432 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:22:20,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:22:20,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:22:20,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:22:20,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:22:20,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:22:20,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:22:20,435 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:22:20,435 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:22:20,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:22:20,436 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:22:20,436 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:22:20,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:22:20,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:22:20,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:22:20,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:22:20,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:22:20,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:22:20,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:22:20,439 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:22:20,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:22:20,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:22:20,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:22:20,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:22:20,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:22:20,440 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 40add90db9f8d501baba3978de407d6383e788a1a5fafc7225d7676b58d18c84 [2024-11-09 23:22:20,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:22:20,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:22:20,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:22:20,715 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:22:20,716 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:22:20,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2024-11-09 23:22:22,275 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:22:22,457 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:22:22,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2024-11-09 23:22:22,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1927651dc/4fb1a27d228e45cb92a1d1e9e114174b/FLAG40780bd8b [2024-11-09 23:22:22,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1927651dc/4fb1a27d228e45cb92a1d1e9e114174b [2024-11-09 23:22:22,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:22:22,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:22:22,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:22:22,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:22:22,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:22:22,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:22:22" (1/1) ... [2024-11-09 23:22:22,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24788fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:22, skipping insertion in model container [2024-11-09 23:22:22,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:22:22" (1/1) ... [2024-11-09 23:22:22,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:22:22,734 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2024-11-09 23:22:22,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:22:22,748 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:22:22,760 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2024-11-09 23:22:22,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:22:22,774 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:22:22,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:22 WrapperNode [2024-11-09 23:22:22,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:22:22,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:22:22,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:22:22,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:22:22,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:22" (1/1) ... [2024-11-09 23:22:22,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:22" (1/1) ... [2024-11-09 23:22:22,801 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-09 23:22:22,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:22:22,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:22:22,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:22:22,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:22:22,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:22" (1/1) ... [2024-11-09 23:22:22,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:22" (1/1) ... [2024-11-09 23:22:22,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:22" (1/1) ... [2024-11-09 23:22:22,822 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]. [2024-11-09 23:22:22,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:22" (1/1) ... [2024-11-09 23:22:22,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:22" (1/1) ... [2024-11-09 23:22:22,827 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:22" (1/1) ... [2024-11-09 23:22:22,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:22" (1/1) ... [2024-11-09 23:22:22,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:22" (1/1) ... [2024-11-09 23:22:22,829 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:22" (1/1) ... [2024-11-09 23:22:22,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:22:22,835 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:22:22,835 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:22:22,835 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:22:22,836 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:22" (1/1) ... [2024-11-09 23:22:22,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:22:22,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:22,868 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) [2024-11-09 23:22:22,871 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 [2024-11-09 23:22:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:22:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:22:22,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:22:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:22:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2024-11-09 23:22:22,911 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2024-11-09 23:22:22,965 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:22:22,966 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:22:23,073 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: havoc #t~ret4;havoc #t~ret5; [2024-11-09 23:22:23,086 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-09 23:22:23,086 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:22:23,098 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:22:23,098 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:22:23,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:22:23 BoogieIcfgContainer [2024-11-09 23:22:23,099 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:22:23,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:22:23,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:22:23,106 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:22:23,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:22:22" (1/3) ... [2024-11-09 23:22:23,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e132429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:22:23, skipping insertion in model container [2024-11-09 23:22:23,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:22:22" (2/3) ... [2024-11-09 23:22:23,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e132429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:22:23, skipping insertion in model container [2024-11-09 23:22:23,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:22:23" (3/3) ... [2024-11-09 23:22:23,110 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2024-11-09 23:22:23,127 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:22:23,128 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:22:23,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:22:23,197 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;@66a69db3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:22:23,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:22:23,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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) [2024-11-09 23:22:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 23:22:23,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:23,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:23,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:23,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:23,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1618600911, now seen corresponding path program 1 times [2024-11-09 23:22:23,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:23,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763589486] [2024-11-09 23:22:23,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:23,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:23,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:22:23,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:23,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763589486] [2024-11-09 23:22:23,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763589486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:22:23,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:22:23,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:22:23,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566137161] [2024-11-09 23:22:23,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:22:23,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:22:23,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:23,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:22:23,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:22:23,537 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:22:23,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:23,596 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-11-09 23:22:23,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:22:23,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 23:22:23,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:23,607 INFO L225 Difference]: With dead ends: 33 [2024-11-09 23:22:23,608 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 23:22:23,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:22:23,615 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:23,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:22:23,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 23:22:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 23:22:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 23:22:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-11-09 23:22:23,659 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2024-11-09 23:22:23,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:23,660 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-09 23:22:23,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:22:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-11-09 23:22:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 23:22:23,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:23,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:23,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:22:23,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:23,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:23,665 INFO L85 PathProgramCache]: Analyzing trace with hash 255505078, now seen corresponding path program 1 times [2024-11-09 23:22:23,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:23,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496932466] [2024-11-09 23:22:23,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:23,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:23,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:22:23,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:23,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496932466] [2024-11-09 23:22:23,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496932466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:22:23,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:22:23,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:22:23,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090452608] [2024-11-09 23:22:23,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:22:23,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:22:23,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:23,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:22:23,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:22:23,824 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:22:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:23,848 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2024-11-09 23:22:23,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:22:23,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 23:22:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:23,850 INFO L225 Difference]: With dead ends: 26 [2024-11-09 23:22:23,850 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 23:22:23,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:22:23,852 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:23,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:22:23,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 23:22:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-11-09 23:22:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 23:22:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-11-09 23:22:23,864 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2024-11-09 23:22:23,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:23,865 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-09 23:22:23,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:22:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-11-09 23:22:23,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 23:22:23,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:23,868 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:23,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:22:23,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:23,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:23,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2133452464, now seen corresponding path program 1 times [2024-11-09 23:22:23,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:23,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038373676] [2024-11-09 23:22:23,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:23,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:23,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:24,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:24,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 23:22:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 23:22:24,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:24,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038373676] [2024-11-09 23:22:24,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038373676] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:24,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269147775] [2024-11-09 23:22:24,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:24,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:24,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:24,106 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) [2024-11-09 23:22:24,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:22:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:24,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:22:24,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 23:22:24,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:22:24,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269147775] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:24,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:24,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2024-11-09 23:22:24,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867629688] [2024-11-09 23:22:24,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:24,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:22:24,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:24,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:22:24,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:22:24,520 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 12 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 23:22:24,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:24,624 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2024-11-09 23:22:24,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:22:24,625 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 24 [2024-11-09 23:22:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:24,626 INFO L225 Difference]: With dead ends: 37 [2024-11-09 23:22:24,627 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 23:22:24,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:22:24,631 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:24,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 58 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:22:24,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 23:22:24,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-09 23:22:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 23:22:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-11-09 23:22:24,642 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 24 [2024-11-09 23:22:24,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:24,643 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-09 23:22:24,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 23:22:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-11-09 23:22:24,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 23:22:24,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:24,646 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:24,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 23:22:24,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:24,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:24,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:24,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1554719849, now seen corresponding path program 1 times [2024-11-09 23:22:24,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:24,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862627407] [2024-11-09 23:22:24,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:24,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:24,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:24,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:25,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 23:22:25,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:25,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862627407] [2024-11-09 23:22:25,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862627407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:25,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040785784] [2024-11-09 23:22:25,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:25,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:25,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:25,025 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) [2024-11-09 23:22:25,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:22:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:25,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:22:25,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 23:22:25,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:22:25,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040785784] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:25,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:25,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2024-11-09 23:22:25,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269966603] [2024-11-09 23:22:25,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:25,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 23:22:25,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:25,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 23:22:25,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:22:25,277 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 23:22:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:25,403 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2024-11-09 23:22:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:22:25,404 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 25 [2024-11-09 23:22:25,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:25,407 INFO L225 Difference]: With dead ends: 40 [2024-11-09 23:22:25,408 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 23:22:25,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:22:25,410 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:25,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 68 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:22:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 23:22:25,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 23:22:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-09 23:22:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2024-11-09 23:22:25,421 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 25 [2024-11-09 23:22:25,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:25,421 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2024-11-09 23:22:25,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 23:22:25,422 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2024-11-09 23:22:25,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 23:22:25,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:25,423 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:25,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 23:22:25,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 23:22:25,624 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:25,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:25,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1938419752, now seen corresponding path program 2 times [2024-11-09 23:22:25,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:25,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511560503] [2024-11-09 23:22:25,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:25,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:25,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:25,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:25,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:25,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:25,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 23:22:25,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:25,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511560503] [2024-11-09 23:22:25,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511560503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:25,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971444376] [2024-11-09 23:22:25,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 23:22:25,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:25,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:25,820 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) [2024-11-09 23:22:25,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 23:22:25,872 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 23:22:25,872 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:22:25,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:22:25,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 23:22:25,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 23:22:26,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971444376] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:26,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:26,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2024-11-09 23:22:26,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542460739] [2024-11-09 23:22:26,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:26,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 23:22:26,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:26,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 23:22:26,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:22:26,326 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand has 17 states, 15 states have (on average 3.0) internal successors, (45), 17 states have internal predecessors, (45), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-09 23:22:26,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:26,494 INFO L93 Difference]: Finished difference Result 71 states and 108 transitions. [2024-11-09 23:22:26,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 23:22:26,495 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.0) internal successors, (45), 17 states have internal predecessors, (45), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 38 [2024-11-09 23:22:26,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:26,496 INFO L225 Difference]: With dead ends: 71 [2024-11-09 23:22:26,496 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 23:22:26,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:22:26,497 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 43 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:26,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 76 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:22:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 23:22:26,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-09 23:22:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-09 23:22:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-11-09 23:22:26,510 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 38 [2024-11-09 23:22:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:26,510 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-09 23:22:26,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.0) internal successors, (45), 17 states have internal predecessors, (45), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-09 23:22:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-11-09 23:22:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 23:22:26,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:26,514 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:26,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 23:22:26,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:26,715 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:26,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:26,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1125589302, now seen corresponding path program 3 times [2024-11-09 23:22:26,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:26,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316983977] [2024-11-09 23:22:26,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:26,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:26,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:27,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:27,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:27,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:27,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:27,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:27,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:27,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:27,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:27,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:27,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:27,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:27,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-09 23:22:27,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:27,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316983977] [2024-11-09 23:22:27,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316983977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:27,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891351850] [2024-11-09 23:22:27,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 23:22:27,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:27,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:27,187 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) [2024-11-09 23:22:27,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 23:22:27,244 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-09 23:22:27,245 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:22:27,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:22:27,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:27,319 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-11-09 23:22:27,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:27,738 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-09 23:22:27,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891351850] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:27,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:27,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 19 [2024-11-09 23:22:27,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878189995] [2024-11-09 23:22:27,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:27,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 23:22:27,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:27,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 23:22:27,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:22:27,741 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-09 23:22:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:28,011 INFO L93 Difference]: Finished difference Result 91 states and 135 transitions. [2024-11-09 23:22:28,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 23:22:28,012 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) Word has length 94 [2024-11-09 23:22:28,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:28,014 INFO L225 Difference]: With dead ends: 91 [2024-11-09 23:22:28,015 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 23:22:28,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 201 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2024-11-09 23:22:28,020 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 56 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:28,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 93 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:22:28,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 23:22:28,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2024-11-09 23:22:28,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 35 states have internal predecessors, (40), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-09 23:22:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2024-11-09 23:22:28,036 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 94 [2024-11-09 23:22:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:28,038 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2024-11-09 23:22:28,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-09 23:22:28,039 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2024-11-09 23:22:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 23:22:28,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:28,042 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:28,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 23:22:28,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:28,243 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:28,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:28,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1734819621, now seen corresponding path program 4 times [2024-11-09 23:22:28,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:28,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973709492] [2024-11-09 23:22:28,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:28,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:28,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:28,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:28,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:28,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:28,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:28,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:28,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:28,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:28,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:28,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:28,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:22:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:28,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:28,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:28,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:28,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-11-09 23:22:28,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:28,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973709492] [2024-11-09 23:22:28,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973709492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:28,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839496627] [2024-11-09 23:22:28,629 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 23:22:28,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:28,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:28,631 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) [2024-11-09 23:22:28,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 23:22:28,693 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 23:22:28,693 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:22:28,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 23:22:28,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:28,763 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-11-09 23:22:28,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 255 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-11-09 23:22:29,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839496627] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:29,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:29,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 13] total 20 [2024-11-09 23:22:29,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148487531] [2024-11-09 23:22:29,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:29,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 23:22:29,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:29,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 23:22:29,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:22:29,635 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 20 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 20 states have internal predecessors, (55), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-09 23:22:29,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:29,799 INFO L93 Difference]: Finished difference Result 124 states and 174 transitions. [2024-11-09 23:22:29,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:22:29,800 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 20 states have internal predecessors, (55), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) Word has length 107 [2024-11-09 23:22:29,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:29,802 INFO L225 Difference]: With dead ends: 124 [2024-11-09 23:22:29,802 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 23:22:29,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 231 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:22:29,803 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 68 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:29,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 86 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:22:29,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 23:22:29,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2024-11-09 23:22:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 74 states have (on average 1.135135135135135) internal successors, (84), 72 states have internal predecessors, (84), 22 states have call successors, (22), 11 states have call predecessors, (22), 13 states have return successors, (49), 26 states have call predecessors, (49), 22 states have call successors, (49) [2024-11-09 23:22:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2024-11-09 23:22:29,821 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 107 [2024-11-09 23:22:29,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:29,821 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2024-11-09 23:22:29,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 20 states have internal predecessors, (55), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-09 23:22:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2024-11-09 23:22:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-09 23:22:29,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:29,824 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:29,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 23:22:30,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:30,029 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:30,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:30,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1778607007, now seen corresponding path program 5 times [2024-11-09 23:22:30,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:30,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226470645] [2024-11-09 23:22:30,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:30,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:22:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:22:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 23:22:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:22:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:22:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:22:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:22:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:22:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2024-11-09 23:22:30,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:22:30,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226470645] [2024-11-09 23:22:30,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226470645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:22:30,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726557772] [2024-11-09 23:22:30,643 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 23:22:30,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:30,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:22:30,645 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) [2024-11-09 23:22:30,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 23:22:30,744 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-11-09 23:22:30,744 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:22:30,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 23:22:30,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:22:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2024-11-09 23:22:30,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:22:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 330 proven. 130 refuted. 0 times theorem prover too weak. 1194 trivial. 0 not checked. [2024-11-09 23:22:31,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726557772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:22:31,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:22:31,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 11] total 20 [2024-11-09 23:22:31,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638166215] [2024-11-09 23:22:31,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:22:31,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 23:22:31,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:22:31,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 23:22:31,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:22:31,467 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (23), 15 states have call predecessors, (23), 13 states have call successors, (23) [2024-11-09 23:22:31,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:22:31,638 INFO L93 Difference]: Finished difference Result 252 states and 386 transitions. [2024-11-09 23:22:31,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:22:31,639 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (23), 15 states have call predecessors, (23), 13 states have call successors, (23) Word has length 175 [2024-11-09 23:22:31,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:22:31,647 INFO L225 Difference]: With dead ends: 252 [2024-11-09 23:22:31,647 INFO L226 Difference]: Without dead ends: 247 [2024-11-09 23:22:31,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 389 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:22:31,649 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 95 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:22:31,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 86 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:22:31,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-09 23:22:31,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 235. [2024-11-09 23:22:31,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 154 states have (on average 1.1428571428571428) internal successors, (176), 150 states have internal predecessors, (176), 52 states have call successors, (52), 21 states have call predecessors, (52), 28 states have return successors, (135), 63 states have call predecessors, (135), 52 states have call successors, (135) [2024-11-09 23:22:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 363 transitions. [2024-11-09 23:22:31,736 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 363 transitions. Word has length 175 [2024-11-09 23:22:31,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:22:31,736 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 363 transitions. [2024-11-09 23:22:31,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (23), 15 states have call predecessors, (23), 13 states have call successors, (23) [2024-11-09 23:22:31,737 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 363 transitions. [2024-11-09 23:22:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2024-11-09 23:22:31,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:22:31,743 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:22:31,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 23:22:31,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:22:31,947 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:22:31,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:22:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash -52775606, now seen corresponding path program 6 times [2024-11-09 23:22:31,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:22:31,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356175202] [2024-11-09 23:22:31,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:22:31,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:22:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:22:31,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 23:22:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:22:32,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 23:22:32,044 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 23:22:32,045 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:22:32,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:22:32,048 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2024-11-09 23:22:32,126 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:22:32,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:22:32 BoogieIcfgContainer [2024-11-09 23:22:32,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 23:22:32,130 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 23:22:32,130 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 23:22:32,130 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 23:22:32,131 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:22:23" (3/4) ... [2024-11-09 23:22:32,131 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 23:22:32,199 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 23:22:32,199 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 23:22:32,200 INFO L158 Benchmark]: Toolchain (without parser) took 9707.18ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 94.6MB in the beginning and 154.8MB in the end (delta: -60.2MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-11-09 23:22:32,200 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 76.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:22:32,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.21ms. Allocated memory is still 163.6MB. Free memory was 94.4MB in the beginning and 132.0MB in the end (delta: -37.6MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-11-09 23:22:32,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.27ms. Allocated memory is still 163.6MB. Free memory was 132.0MB in the beginning and 130.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:22:32,201 INFO L158 Benchmark]: Boogie Preprocessor took 31.85ms. Allocated memory is still 163.6MB. Free memory was 130.6MB in the beginning and 129.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:22:32,201 INFO L158 Benchmark]: IcfgBuilder took 264.04ms. Allocated memory is still 163.6MB. Free memory was 129.3MB in the beginning and 118.9MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 23:22:32,201 INFO L158 Benchmark]: TraceAbstraction took 9027.38ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 118.0MB in the beginning and 161.1MB in the end (delta: -43.1MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2024-11-09 23:22:32,202 INFO L158 Benchmark]: Witness Printer took 69.05ms. Allocated memory is still 237.0MB. Free memory was 161.1MB in the beginning and 154.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 23:22:32,203 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 76.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.21ms. Allocated memory is still 163.6MB. Free memory was 94.4MB in the beginning and 132.0MB in the end (delta: -37.6MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.27ms. Allocated memory is still 163.6MB. Free memory was 132.0MB in the beginning and 130.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.85ms. Allocated memory is still 163.6MB. Free memory was 130.6MB in the beginning and 129.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 264.04ms. Allocated memory is still 163.6MB. Free memory was 129.3MB in the beginning and 118.9MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9027.38ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 118.0MB in the beginning and 161.1MB in the end (delta: -43.1MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * Witness Printer took 69.05ms. Allocated memory is still 237.0MB. Free memory was 161.1MB in the beginning and 154.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 7; VAL [x=7] [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [x=7] [L27] int result = fibo(x); [L28] COND TRUE result == 13 VAL [x=7] [L29] reach_error() VAL [x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 9, TraceHistogramMax: 41, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 304 mSDsluCounter, 628 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 472 mSDsCounter, 290 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 709 IncrementalHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 290 mSolverCounterUnsat, 156 mSDtfsCounter, 709 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1140 GetRequests, 1004 SyntacticMatches, 21 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=8, InterpolantAutomatonStates: 84, 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, 8 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 1233 NumberOfCodeBlocks, 1182 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1392 ConstructedInterpolants, 0 QuantifiedInterpolants, 2548 SizeOfPredicates, 13 NumberOfNonLiveVariables, 996 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 6385/8169 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-09 23:22:32,232 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE