./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci01-1.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci01-1.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 20:24:39,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:24:39,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:24:39,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:24:39,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:24:39,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:24:39,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:24:39,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:24:39,644 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:24:39,644 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:24:39,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:24:39,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:24:39,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:24:39,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:24:39,648 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:24:39,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:24:39,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:24:39,649 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:24:39,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:24:39,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:24:39,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:24:39,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:24:39,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:24:39,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:24:39,651 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:24:39,651 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:24:39,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:24:39,651 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:24:39,651 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:24:39,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:24:39,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:24:39,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:24:39,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:24:39,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:24:39,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:24:39,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:24:39,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:24:39,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:24:39,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:24:39,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:24:39,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:24:39,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:24:39,654 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 20:24:39,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:24:39,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:24:39,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:24:39,883 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:24:39,883 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:24:39,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/Fibonacci01-1.c [2024-09-11 20:24:41,002 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:24:41,163 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:24:41,163 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Fibonacci01-1.c [2024-09-11 20:24:41,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/be63a6398/704d9600e463477fa434e519b56e908b/FLAG08995409a [2024-09-11 20:24:41,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/be63a6398/704d9600e463477fa434e519b56e908b [2024-09-11 20:24:41,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:24:41,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:24:41,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:24:41,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:24:41,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:24:41,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:24:41" (1/1) ... [2024-09-11 20:24:41,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ea31e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:41, skipping insertion in model container [2024-09-11 20:24:41,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:24:41" (1/1) ... [2024-09-11 20:24:41,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:24:41,705 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Fibonacci01-1.c[804,817] [2024-09-11 20:24:41,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:24:41,714 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:24:41,722 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Fibonacci01-1.c[804,817] [2024-09-11 20:24:41,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:24:41,733 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:24:41,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:41 WrapperNode [2024-09-11 20:24:41,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:24:41,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:24:41,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:24:41,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:24:41,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:41" (1/1) ... [2024-09-11 20:24:41,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:41" (1/1) ... [2024-09-11 20:24:41,760 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2024-09-11 20:24:41,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:24:41,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:24:41,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:24:41,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:24:41,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:41" (1/1) ... [2024-09-11 20:24:41,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:41" (1/1) ... [2024-09-11 20:24:41,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:41" (1/1) ... [2024-09-11 20:24:41,775 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-09-11 20:24:41,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:41" (1/1) ... [2024-09-11 20:24:41,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:41" (1/1) ... [2024-09-11 20:24:41,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:41" (1/1) ... [2024-09-11 20:24:41,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:41" (1/1) ... [2024-09-11 20:24:41,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:41" (1/1) ... [2024-09-11 20:24:41,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:41" (1/1) ... [2024-09-11 20:24:41,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:24:41,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:24:41,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:24:41,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:24:41,783 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:41" (1/1) ... [2024-09-11 20:24:41,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:24:41,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:41,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 20:24:41,815 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 20:24:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2024-09-11 20:24:41,849 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2024-09-11 20:24:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:24:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:24:41,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:24:41,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:24:41,896 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:24:41,898 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:24:42,037 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-09-11 20:24:42,037 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:24:42,068 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:24:42,068 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-11 20:24:42,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:24:42 BoogieIcfgContainer [2024-09-11 20:24:42,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:24:42,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:24:42,071 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:24:42,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:24:42,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:24:41" (1/3) ... [2024-09-11 20:24:42,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6598cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:24:42, skipping insertion in model container [2024-09-11 20:24:42,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:41" (2/3) ... [2024-09-11 20:24:42,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6598cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:24:42, skipping insertion in model container [2024-09-11 20:24:42,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:24:42" (3/3) ... [2024-09-11 20:24:42,076 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2024-09-11 20:24:42,088 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:24:42,089 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:24:42,127 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:24:42,132 INFO L336 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=All, 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;@1259f0ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:24:42,132 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:24:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-09-11 20:24:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 20:24:42,140 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:42,140 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:42,141 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:42,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:42,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1216674335, now seen corresponding path program 1 times [2024-09-11 20:24:42,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:42,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582316035] [2024-09-11 20:24:42,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:42,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:42,354 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:24:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:24:42,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:42,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582316035] [2024-09-11 20:24:42,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582316035] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:24:42,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:24:42,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 20:24:42,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416477810] [2024-09-11 20:24:42,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:24:42,448 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:24:42,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:42,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:24:42,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:24:42,465 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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-09-11 20:24:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:42,559 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2024-09-11 20:24:42,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:24:42,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2024-09-11 20:24:42,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:42,567 INFO L225 Difference]: With dead ends: 28 [2024-09-11 20:24:42,567 INFO L226 Difference]: Without dead ends: 20 [2024-09-11 20:24:42,569 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:24:42,571 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:42,572 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 39 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:24:42,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-11 20:24:42,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-09-11 20:24:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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-09-11 20:24:42,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-09-11 20:24:42,601 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2024-09-11 20:24:42,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:42,601 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-09-11 20:24:42,601 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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-09-11 20:24:42,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:42,602 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-09-11 20:24:42,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-11 20:24:42,603 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:42,603 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:42,603 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:24:42,603 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:42,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:42,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1629096597, now seen corresponding path program 1 times [2024-09-11 20:24:42,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:42,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624080087] [2024-09-11 20:24:42,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:42,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:42,682 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:24:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:24:42,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:42,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624080087] [2024-09-11 20:24:42,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624080087] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:24:42,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:24:42,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 20:24:42,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023404446] [2024-09-11 20:24:42,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:24:42,721 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:24:42,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:42,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:24:42,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:24:42,722 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-09-11 20:24:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:42,792 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-09-11 20:24:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:24:42,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-09-11 20:24:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:42,794 INFO L225 Difference]: With dead ends: 24 [2024-09-11 20:24:42,794 INFO L226 Difference]: Without dead ends: 20 [2024-09-11 20:24:42,794 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:24:42,795 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:42,795 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:24:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-11 20:24:42,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-09-11 20:24:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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-09-11 20:24:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-09-11 20:24:42,804 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2024-09-11 20:24:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:42,804 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-09-11 20:24:42,805 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-09-11 20:24:42,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-09-11 20:24:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-11 20:24:42,807 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:42,807 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:42,807 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:24:42,807 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:42,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:42,808 INFO L85 PathProgramCache]: Analyzing trace with hash 161002844, now seen corresponding path program 1 times [2024-09-11 20:24:42,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:42,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828361864] [2024-09-11 20:24:42,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:42,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:42,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:24:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:42,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:42,933 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:24:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:42,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:24:42,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:42,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828361864] [2024-09-11 20:24:42,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828361864] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:24:42,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868768643] [2024-09-11 20:24:42,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:42,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:42,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:42,957 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:24:42,958 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 20:24:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:43,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-11 20:24:43,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:24:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:24:43,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:24:43,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 20:24:43,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868768643] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:24:43,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:24:43,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 21 [2024-09-11 20:24:43,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139559524] [2024-09-11 20:24:43,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:24:43,560 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-11 20:24:43,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:43,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-11 20:24:43,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-09-11 20:24:43,561 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-11 20:24:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:43,686 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-09-11 20:24:43,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 20:24:43,687 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 23 [2024-09-11 20:24:43,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:43,687 INFO L225 Difference]: With dead ends: 35 [2024-09-11 20:24:43,687 INFO L226 Difference]: Without dead ends: 20 [2024-09-11 20:24:43,688 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-09-11 20:24:43,688 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:43,689 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 88 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:24:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-11 20:24:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-09-11 20:24:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 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-09-11 20:24:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-09-11 20:24:43,698 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2024-09-11 20:24:43,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:43,698 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-09-11 20:24:43,698 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-11 20:24:43,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:43,698 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-09-11 20:24:43,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-11 20:24:43,699 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:43,699 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:43,713 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-11 20:24:43,899 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:43,900 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:43,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:43,901 INFO L85 PathProgramCache]: Analyzing trace with hash 592483530, now seen corresponding path program 1 times [2024-09-11 20:24:43,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:43,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559180054] [2024-09-11 20:24:43,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:43,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:43,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:24:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:44,057 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:44,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:24:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-11 20:24:44,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:44,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559180054] [2024-09-11 20:24:44,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559180054] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:24:44,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693172814] [2024-09-11 20:24:44,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:44,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:44,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:44,096 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:24:44,097 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 20:24:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:44,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-11 20:24:44,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:24:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-11 20:24:44,260 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:24:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 20:24:44,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693172814] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:24:44,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:24:44,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 20 [2024-09-11 20:24:44,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622958910] [2024-09-11 20:24:44,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:24:44,506 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-11 20:24:44,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:44,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-11 20:24:44,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-09-11 20:24:44,509 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 16 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-11 20:24:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:44,664 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-09-11 20:24:44,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 20:24:44,664 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 16 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 24 [2024-09-11 20:24:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:44,665 INFO L225 Difference]: With dead ends: 31 [2024-09-11 20:24:44,665 INFO L226 Difference]: Without dead ends: 27 [2024-09-11 20:24:44,666 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2024-09-11 20:24:44,666 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:44,667 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 67 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:24:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-11 20:24:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2024-09-11 20:24:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2024-09-11 20:24:44,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2024-09-11 20:24:44,673 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 24 [2024-09-11 20:24:44,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:44,673 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-09-11 20:24:44,674 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 16 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-11 20:24:44,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:44,674 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2024-09-11 20:24:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-11 20:24:44,675 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:44,676 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:44,688 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 20:24:44,879 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:44,880 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:44,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:44,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1310194259, now seen corresponding path program 2 times [2024-09-11 20:24:44,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:44,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849928729] [2024-09-11 20:24:44,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:44,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:44,920 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:24:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:44,942 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:44,986 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:44,990 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:24:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:44,993 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:24:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-11 20:24:45,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:45,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849928729] [2024-09-11 20:24:45,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849928729] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:24:45,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304932805] [2024-09-11 20:24:45,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:24:45,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:45,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:45,005 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:24:45,006 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-11 20:24:45,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:24:45,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:24:45,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 20:24:45,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:24:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:24:45,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:24:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-11 20:24:45,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304932805] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:24:45,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:24:45,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 14 [2024-09-11 20:24:45,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348072012] [2024-09-11 20:24:45,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:24:45,271 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-11 20:24:45,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:45,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-11 20:24:45,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-09-11 20:24:45,273 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-11 20:24:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:45,348 INFO L93 Difference]: Finished difference Result 52 states and 76 transitions. [2024-09-11 20:24:45,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 20:24:45,349 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 37 [2024-09-11 20:24:45,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:45,350 INFO L225 Difference]: With dead ends: 52 [2024-09-11 20:24:45,351 INFO L226 Difference]: Without dead ends: 30 [2024-09-11 20:24:45,352 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-09-11 20:24:45,352 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:45,352 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 73 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:24:45,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-11 20:24:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-09-11 20:24:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2024-09-11 20:24:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-09-11 20:24:45,357 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 37 [2024-09-11 20:24:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:45,358 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-09-11 20:24:45,358 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-11 20:24:45,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-09-11 20:24:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-11 20:24:45,359 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:45,359 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:45,371 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-11 20:24:45,562 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:45,563 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:45,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:45,563 INFO L85 PathProgramCache]: Analyzing trace with hash 651238953, now seen corresponding path program 3 times [2024-09-11 20:24:45,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:45,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090542628] [2024-09-11 20:24:45,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:45,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:45,633 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:24:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:45,705 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:45,757 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:45,774 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:24:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:45,788 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:24:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-11 20:24:45,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:45,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090542628] [2024-09-11 20:24:45,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090542628] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:24:45,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300265473] [2024-09-11 20:24:45,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:24:45,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:45,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:45,806 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:24:45,808 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-11 20:24:45,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-11 20:24:45,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:24:45,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-11 20:24:45,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:24:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-11 20:24:45,996 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:24:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-11 20:24:46,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300265473] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:24:46,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:24:46,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 25 [2024-09-11 20:24:46,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208544622] [2024-09-11 20:24:46,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:24:46,422 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-11 20:24:46,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:46,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-11 20:24:46,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2024-09-11 20:24:46,422 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.64) internal successors, (41), 19 states have internal predecessors, (41), 9 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2024-09-11 20:24:46,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:46,644 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2024-09-11 20:24:46,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-11 20:24:46,645 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.64) internal successors, (41), 19 states have internal predecessors, (41), 9 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) Word has length 38 [2024-09-11 20:24:46,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:46,645 INFO L225 Difference]: With dead ends: 41 [2024-09-11 20:24:46,645 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:24:46,646 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2024-09-11 20:24:46,646 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:46,647 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 70 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:24:46,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:24:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:24:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:24:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:24:46,647 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2024-09-11 20:24:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:46,647 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:24:46,648 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.64) internal successors, (41), 19 states have internal predecessors, (41), 9 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2024-09-11 20:24:46,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:24:46,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:24:46,650 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:24:46,662 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 20:24:46,851 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:46,854 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-09-11 20:24:46,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:24:47,421 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:24:47,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:24:47 BoogieIcfgContainer [2024-09-11 20:24:47,435 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:24:47,436 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:24:47,436 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:24:47,437 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:24:47,437 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:24:42" (3/4) ... [2024-09-11 20:24:47,439 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:24:47,441 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2024-09-11 20:24:47,444 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-11 20:24:47,444 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-11 20:24:47,444 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:24:47,444 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:24:47,507 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:24:47,509 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:24:47,509 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:24:47,510 INFO L158 Benchmark]: Toolchain (without parser) took 5928.58ms. Allocated memory was 157.3MB in the beginning and 232.8MB in the end (delta: 75.5MB). Free memory was 129.6MB in the beginning and 160.0MB in the end (delta: -30.4MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2024-09-11 20:24:47,512 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 157.3MB. Free memory was 120.7MB in the beginning and 120.5MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:24:47,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.55ms. Allocated memory is still 157.3MB. Free memory was 128.8MB in the beginning and 118.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 20:24:47,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.80ms. Allocated memory is still 157.3MB. Free memory was 118.2MB in the beginning and 116.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:24:47,513 INFO L158 Benchmark]: Boogie Preprocessor took 19.06ms. Allocated memory is still 157.3MB. Free memory was 116.5MB in the beginning and 115.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:24:47,513 INFO L158 Benchmark]: RCFGBuilder took 286.44ms. Allocated memory is still 157.3MB. Free memory was 114.6MB in the beginning and 125.7MB in the end (delta: -11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 20:24:47,513 INFO L158 Benchmark]: TraceAbstraction took 5364.32ms. Allocated memory was 157.3MB in the beginning and 232.8MB in the end (delta: 75.5MB). Free memory was 125.2MB in the beginning and 164.2MB in the end (delta: -39.0MB). Peak memory consumption was 111.2MB. Max. memory is 16.1GB. [2024-09-11 20:24:47,513 INFO L158 Benchmark]: Witness Printer took 73.78ms. Allocated memory is still 232.8MB. Free memory was 164.2MB in the beginning and 160.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 20:24:47,514 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.15ms. Allocated memory is still 157.3MB. Free memory was 120.7MB in the beginning and 120.5MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.55ms. Allocated memory is still 157.3MB. Free memory was 128.8MB in the beginning and 118.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.80ms. Allocated memory is still 157.3MB. Free memory was 118.2MB in the beginning and 116.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.06ms. Allocated memory is still 157.3MB. Free memory was 116.5MB in the beginning and 115.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 286.44ms. Allocated memory is still 157.3MB. Free memory was 114.6MB in the beginning and 125.7MB in the end (delta: -11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5364.32ms. Allocated memory was 157.3MB in the beginning and 232.8MB in the end (delta: 75.5MB). Free memory was 125.2MB in the beginning and 164.2MB in the end (delta: -39.0MB). Peak memory consumption was 111.2MB. Max. memory is 16.1GB. * Witness Printer took 73.78ms. Allocated memory is still 232.8MB. Free memory was 164.2MB in the beginning and 160.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 382 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 308 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 831 IncrementalHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 74 mSDtfsCounter, 831 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 225 SyntacticMatches, 16 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=5, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 265 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 373 ConstructedInterpolants, 0 QuantifiedInterpolants, 1188 SizeOfPredicates, 5 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 232/366 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for fibonacci Derived contract for procedure fibonacci. Ensures: ((((2 <= \old(n)) && (\old(n) <= ((long long) \result + 1))) || ((\old(n) <= 0) && ((\result == 1) || (\result == 0)))) || ((\result == 1) && (1 == \old(n)))) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:24:47,532 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE