./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_2-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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_2calls_2-1.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.graphml --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 2c47a69833f1a958e38c27482b535b2d176258e52297f9899a8926a996c05520 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:14:59,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:14:59,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:14:59,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:14:59,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:14:59,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:14:59,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:14:59,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:14:59,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:14:59,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:14:59,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:14:59,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:14:59,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:14:59,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:14:59,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:14:59,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:14:59,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:14:59,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:14:59,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:14:59,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:14:59,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:14:59,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:14:59,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:14:59,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:14:59,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:14:59,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:14:59,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:14:59,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:14:59,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:14:59,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:14:59,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:14:59,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:14:59,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:14:59,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:15:00,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:15:00,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:15:00,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:15:00,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:15:00,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:15:00,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:15:00,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:15:00,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:15:00,023 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:15:00,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:15:00,026 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:15:00,026 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:15:00,027 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:15:00,027 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:15:00,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:15:00,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:15:00,028 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:15:00,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:15:00,029 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:15:00,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:15:00,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:15:00,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:15:00,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:15:00,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:15:00,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:15:00,030 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:15:00,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:15:00,031 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:15:00,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:15:00,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:15:00,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:15:00,031 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:15:00,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:15:00,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:15:00,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:15:00,033 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:15:00,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:15:00,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:15:00,033 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:15:00,034 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:15:00,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:15:00,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 2c47a69833f1a958e38c27482b535b2d176258e52297f9899a8926a996c05520 [2022-02-20 18:15:00,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:15:00,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:15:00,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:15:00,301 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:15:00,302 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:15:00,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_2-1.c [2022-02-20 18:15:00,358 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80fd5944e/1fa18949f17d4995a9a580b6a4ce8b6f/FLAG7a6b5f566 [2022-02-20 18:15:00,686 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:15:00,686 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_2-1.c [2022-02-20 18:15:00,695 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80fd5944e/1fa18949f17d4995a9a580b6a4ce8b6f/FLAG7a6b5f566 [2022-02-20 18:15:01,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80fd5944e/1fa18949f17d4995a9a580b6a4ce8b6f [2022-02-20 18:15:01,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:15:01,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:15:01,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:15:01,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:15:01,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:15:01,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:15:01" (1/1) ... [2022-02-20 18:15:01,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74c37d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:01, skipping insertion in model container [2022-02-20 18:15:01,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:15:01" (1/1) ... [2022-02-20 18:15:01,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:15:01,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:15:01,304 WARN L230 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_2calls_2-1.c[946,959] [2022-02-20 18:15:01,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:15:01,323 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:15:01,357 WARN L230 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_2calls_2-1.c[946,959] [2022-02-20 18:15:01,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:15:01,373 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:15:01,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:01 WrapperNode [2022-02-20 18:15:01,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:15:01,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:15:01,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:15:01,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:15:01,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:01" (1/1) ... [2022-02-20 18:15:01,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:01" (1/1) ... [2022-02-20 18:15:01,409 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-02-20 18:15:01,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:15:01,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:15:01,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:15:01,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:15:01,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:01" (1/1) ... [2022-02-20 18:15:01,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:01" (1/1) ... [2022-02-20 18:15:01,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:01" (1/1) ... [2022-02-20 18:15:01,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:01" (1/1) ... [2022-02-20 18:15:01,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:01" (1/1) ... [2022-02-20 18:15:01,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:01" (1/1) ... [2022-02-20 18:15:01,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:01" (1/1) ... [2022-02-20 18:15:01,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:15:01,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:15:01,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:15:01,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:15:01,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:01" (1/1) ... [2022-02-20 18:15:01,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:15:01,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:01,469 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:15:01,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:15:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:15:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:15:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-02-20 18:15:01,536 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-02-20 18:15:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-02-20 18:15:01,536 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-02-20 18:15:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:15:01,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:15:01,608 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:15:01,610 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:15:01,759 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:15:01,781 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:15:01,782 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:15:01,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:15:01 BoogieIcfgContainer [2022-02-20 18:15:01,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:15:01,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:15:01,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:15:01,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:15:01,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:15:01" (1/3) ... [2022-02-20 18:15:01,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b30f324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:15:01, skipping insertion in model container [2022-02-20 18:15:01,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:01" (2/3) ... [2022-02-20 18:15:01,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b30f324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:15:01, skipping insertion in model container [2022-02-20 18:15:01,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:15:01" (3/3) ... [2022-02-20 18:15:01,789 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-1.c [2022-02-20 18:15:01,792 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:15:01,793 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:15:01,863 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:15:01,868 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:15:01,874 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:15:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:15:01,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 18:15:01,903 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:01,904 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:01,904 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:01,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:01,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2022-02-20 18:15:01,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:01,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038779109] [2022-02-20 18:15:01,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:01,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:02,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:02,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~n := #in~n; {39#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:02,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {40#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:02,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#(<= |fibo1_#in~n| 0)} assume true; {40#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:02,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#(<= |fibo1_#in~n| 0)} {34#(= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {33#false} is VALID [2022-02-20 18:15:02,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-02-20 18:15:02,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {34#(= 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:02,287 INFO L272 TraceCheckUtils]: 2: Hoare triple {34#(= 2 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {32#true} is VALID [2022-02-20 18:15:02,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#true} ~n := #in~n; {39#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:02,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {39#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {40#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:02,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#(<= |fibo1_#in~n| 0)} assume true; {40#(<= |fibo1_#in~n| 0)} is VALID [2022-02-20 18:15:02,290 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {40#(<= |fibo1_#in~n| 0)} {34#(= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {33#false} is VALID [2022-02-20 18:15:02,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {33#false} is VALID [2022-02-20 18:15:02,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#false} assume 1 == main_~result~0#1; {33#false} is VALID [2022-02-20 18:15:02,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-02-20 18:15:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:15:02,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:02,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038779109] [2022-02-20 18:15:02,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038779109] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:15:02,294 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:15:02,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:15:02,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382290748] [2022-02-20 18:15:02,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:15:02,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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 [2022-02-20 18:15:02,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:02,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) 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) [2022-02-20 18:15:02,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:02,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:15:02,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:02,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:15:02,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:15:02,370 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 4 states have (on average 2.0) 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) [2022-02-20 18:15:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:02,580 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-02-20 18:15:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:15:02,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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 [2022-02-20 18:15:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) 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) [2022-02-20 18:15:02,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-02-20 18:15:02,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) 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) [2022-02-20 18:15:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-02-20 18:15:02,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-02-20 18:15:02,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:02,650 INFO L225 Difference]: With dead ends: 39 [2022-02-20 18:15:02,650 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 18:15:02,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:15:02,655 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:02,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 89 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:15:02,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 18:15:02,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 18:15:02,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:02,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:02,690 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:02,690 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:02,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:02,694 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-20 18:15:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 18:15:02,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:02,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:02,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 27 states. [2022-02-20 18:15:02,696 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 27 states. [2022-02-20 18:15:02,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:02,699 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-20 18:15:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 18:15:02,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:02,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:02,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:02,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-02-20 18:15:02,703 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2022-02-20 18:15:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:02,704 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-02-20 18:15:02,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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) [2022-02-20 18:15:02,704 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 18:15:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 18:15:02,705 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:02,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:02,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:15:02,705 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:02,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:02,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2022-02-20 18:15:02,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:02,707 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738230763] [2022-02-20 18:15:02,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:02,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:02,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:02,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {181#true} ~n := #in~n; {189#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:02,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {189#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:02,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {190#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:02,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {190#(<= |fibo1_#in~n| 1)} assume true; {190#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:02,753 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {190#(<= |fibo1_#in~n| 1)} {183#(= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {182#false} is VALID [2022-02-20 18:15:02,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {181#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {181#true} is VALID [2022-02-20 18:15:02,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {183#(= 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:02,754 INFO L272 TraceCheckUtils]: 2: Hoare triple {183#(= 2 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {181#true} is VALID [2022-02-20 18:15:02,755 INFO L290 TraceCheckUtils]: 3: Hoare triple {181#true} ~n := #in~n; {189#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:02,755 INFO L290 TraceCheckUtils]: 4: Hoare triple {189#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {189#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-20 18:15:02,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {190#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:02,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {190#(<= |fibo1_#in~n| 1)} assume true; {190#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:02,757 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {190#(<= |fibo1_#in~n| 1)} {183#(= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {182#false} is VALID [2022-02-20 18:15:02,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {182#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {182#false} is VALID [2022-02-20 18:15:02,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#false} assume 1 == main_~result~0#1; {182#false} is VALID [2022-02-20 18:15:02,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {182#false} assume !false; {182#false} is VALID [2022-02-20 18:15:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:15:02,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:02,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738230763] [2022-02-20 18:15:02,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738230763] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:15:02,759 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:15:02,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:15:02,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995990291] [2022-02-20 18:15:02,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:15:02,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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 [2022-02-20 18:15:02,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:02,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) 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) [2022-02-20 18:15:02,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:02,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:15:02,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:02,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:15:02,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:15:02,771 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 4 states have (on average 2.25) 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) [2022-02-20 18:15:02,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:02,939 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 18:15:02,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:15:02,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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 [2022-02-20 18:15:02,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) 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) [2022-02-20 18:15:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-20 18:15:02,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) 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) [2022-02-20 18:15:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-20 18:15:02,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-02-20 18:15:03,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:03,018 INFO L225 Difference]: With dead ends: 33 [2022-02-20 18:15:03,019 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 18:15:03,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:15:03,024 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:03,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 77 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:15:03,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 18:15:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-02-20 18:15:03,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:03,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:03,032 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:03,032 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:03,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:03,036 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-20 18:15:03,036 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-20 18:15:03,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:03,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:03,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 29 states. [2022-02-20 18:15:03,039 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 29 states. [2022-02-20 18:15:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:03,058 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-20 18:15:03,058 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-20 18:15:03,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:03,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:03,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:03,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:03,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-02-20 18:15:03,069 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2022-02-20 18:15:03,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:03,069 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-02-20 18:15:03,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) 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) [2022-02-20 18:15:03,070 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 18:15:03,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 18:15:03,071 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:03,071 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:03,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:15:03,072 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:03,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:03,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2022-02-20 18:15:03,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:03,073 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494397713] [2022-02-20 18:15:03,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:03,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:03,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:15:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:03,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:15:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:03,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~n := #in~n; {357#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:03,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:03,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {358#(<= |fibo2_#in~n| 0)} assume true; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:03,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {358#(<= |fibo2_#in~n| 0)} {348#(not (<= fibo1_~n 1))} #53#return; {328#false} is VALID [2022-02-20 18:15:03,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 18:15:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:03,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:03,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume ~n < 1;#res := 0; {327#true} is VALID [2022-02-20 18:15:03,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 18:15:03,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {328#false} #55#return; {328#false} is VALID [2022-02-20 18:15:03,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:03,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(~n < 1); {347#(< 0 fibo1_~n)} is VALID [2022-02-20 18:15:03,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#(< 0 fibo1_~n)} assume !(1 == ~n); {348#(not (<= fibo1_~n 1))} is VALID [2022-02-20 18:15:03,295 INFO L272 TraceCheckUtils]: 3: Hoare triple {348#(not (<= fibo1_~n 1))} call #t~ret4 := fibo2(~n - 1); {327#true} is VALID [2022-02-20 18:15:03,296 INFO L290 TraceCheckUtils]: 4: Hoare triple {327#true} ~n := #in~n; {357#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:03,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:03,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {358#(<= |fibo2_#in~n| 0)} assume true; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:03,297 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {358#(<= |fibo2_#in~n| 0)} {348#(not (<= fibo1_~n 1))} #53#return; {328#false} is VALID [2022-02-20 18:15:03,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {328#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {328#false} is VALID [2022-02-20 18:15:03,298 INFO L272 TraceCheckUtils]: 9: Hoare triple {328#false} call #t~ret5 := fibo2(~n - 2); {327#true} is VALID [2022-02-20 18:15:03,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:03,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {327#true} assume ~n < 1;#res := 0; {327#true} is VALID [2022-02-20 18:15:03,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 18:15:03,298 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {327#true} {328#false} #55#return; {328#false} is VALID [2022-02-20 18:15:03,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {328#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {328#false} is VALID [2022-02-20 18:15:03,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {328#false} assume true; {328#false} is VALID [2022-02-20 18:15:03,299 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {328#false} {329#(= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {328#false} is VALID [2022-02-20 18:15:03,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-02-20 18:15:03,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {329#(= 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:03,302 INFO L272 TraceCheckUtils]: 2: Hoare triple {329#(= 2 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {327#true} is VALID [2022-02-20 18:15:03,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:03,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {327#true} assume !(~n < 1); {347#(< 0 fibo1_~n)} is VALID [2022-02-20 18:15:03,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#(< 0 fibo1_~n)} assume !(1 == ~n); {348#(not (<= fibo1_~n 1))} is VALID [2022-02-20 18:15:03,307 INFO L272 TraceCheckUtils]: 6: Hoare triple {348#(not (<= fibo1_~n 1))} call #t~ret4 := fibo2(~n - 1); {327#true} is VALID [2022-02-20 18:15:03,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} ~n := #in~n; {357#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-20 18:15:03,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {357#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:03,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {358#(<= |fibo2_#in~n| 0)} assume true; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:03,309 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {358#(<= |fibo2_#in~n| 0)} {348#(not (<= fibo1_~n 1))} #53#return; {328#false} is VALID [2022-02-20 18:15:03,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {328#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {328#false} is VALID [2022-02-20 18:15:03,309 INFO L272 TraceCheckUtils]: 12: Hoare triple {328#false} call #t~ret5 := fibo2(~n - 2); {327#true} is VALID [2022-02-20 18:15:03,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:03,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume ~n < 1;#res := 0; {327#true} is VALID [2022-02-20 18:15:03,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 18:15:03,310 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {327#true} {328#false} #55#return; {328#false} is VALID [2022-02-20 18:15:03,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {328#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {328#false} is VALID [2022-02-20 18:15:03,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {328#false} assume true; {328#false} is VALID [2022-02-20 18:15:03,310 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {328#false} {329#(= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {328#false} is VALID [2022-02-20 18:15:03,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {328#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {328#false} is VALID [2022-02-20 18:15:03,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {328#false} assume 1 == main_~result~0#1; {328#false} is VALID [2022-02-20 18:15:03,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-02-20 18:15:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:15:03,312 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:15:03,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494397713] [2022-02-20 18:15:03,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494397713] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:15:03,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297308847] [2022-02-20 18:15:03,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:03,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:03,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:03,332 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) [2022-02-20 18:15:03,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 18:15:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:03,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 18:15:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:03,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:15:03,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-02-20 18:15:03,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {365#(<= 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:03,638 INFO L272 TraceCheckUtils]: 2: Hoare triple {365#(<= 2 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {327#true} is VALID [2022-02-20 18:15:03,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#true} ~n := #in~n; {372#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:03,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {372#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {372#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:03,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {372#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {372#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:03,639 INFO L272 TraceCheckUtils]: 6: Hoare triple {372#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {327#true} is VALID [2022-02-20 18:15:03,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} ~n := #in~n; {385#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:03,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {385#(<= |fibo2_#in~n| fibo2_~n)} assume ~n < 1;#res := 0; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:03,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {358#(<= |fibo2_#in~n| 0)} assume true; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:03,648 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {358#(<= |fibo2_#in~n| 0)} {372#(<= |fibo1_#in~n| fibo1_~n)} #53#return; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:03,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {395#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:03,649 INFO L272 TraceCheckUtils]: 12: Hoare triple {395#(<= |fibo1_#in~n| 1)} call #t~ret5 := fibo2(~n - 2); {327#true} is VALID [2022-02-20 18:15:03,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:03,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume ~n < 1;#res := 0; {327#true} is VALID [2022-02-20 18:15:03,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 18:15:03,651 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {327#true} {395#(<= |fibo1_#in~n| 1)} #55#return; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:03,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {395#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:03,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {395#(<= |fibo1_#in~n| 1)} assume true; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:03,652 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {395#(<= |fibo1_#in~n| 1)} {365#(<= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {328#false} is VALID [2022-02-20 18:15:03,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {328#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {328#false} is VALID [2022-02-20 18:15:03,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {328#false} assume 1 == main_~result~0#1; {328#false} is VALID [2022-02-20 18:15:03,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-02-20 18:15:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:15:03,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:15:04,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-02-20 18:15:04,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {328#false} assume 1 == main_~result~0#1; {328#false} is VALID [2022-02-20 18:15:04,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {328#false} assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {328#false} is VALID [2022-02-20 18:15:04,124 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {395#(<= |fibo1_#in~n| 1)} {365#(<= 2 |ULTIMATE.start_main_~x~0#1|)} #47#return; {328#false} is VALID [2022-02-20 18:15:04,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {395#(<= |fibo1_#in~n| 1)} assume true; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:04,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {395#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:04,125 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {327#true} {395#(<= |fibo1_#in~n| 1)} #55#return; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:04,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 18:15:04,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume ~n < 1;#res := 0; {327#true} is VALID [2022-02-20 18:15:04,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} ~n := #in~n; {327#true} is VALID [2022-02-20 18:15:04,126 INFO L272 TraceCheckUtils]: 12: Hoare triple {395#(<= |fibo1_#in~n| 1)} call #t~ret5 := fibo2(~n - 2); {327#true} is VALID [2022-02-20 18:15:04,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {395#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:04,127 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {358#(<= |fibo2_#in~n| 0)} {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} #53#return; {395#(<= |fibo1_#in~n| 1)} is VALID [2022-02-20 18:15:04,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {358#(<= |fibo2_#in~n| 0)} assume true; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:04,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {481#(or (not (< fibo2_~n 1)) (<= |fibo2_#in~n| 0))} assume ~n < 1;#res := 0; {358#(<= |fibo2_#in~n| 0)} is VALID [2022-02-20 18:15:04,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} ~n := #in~n; {481#(or (not (< fibo2_~n 1)) (<= |fibo2_#in~n| 0))} is VALID [2022-02-20 18:15:04,129 INFO L272 TraceCheckUtils]: 6: Hoare triple {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} call #t~ret4 := fibo2(~n - 1); {327#true} is VALID [2022-02-20 18:15:04,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} assume !(1 == ~n); {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-20 18:15:04,130 INFO L290 TraceCheckUtils]: 4: Hoare triple {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} assume !(~n < 1); {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-20 18:15:04,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#true} ~n := #in~n; {471#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-20 18:15:04,130 INFO L272 TraceCheckUtils]: 2: Hoare triple {365#(<= 2 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {327#true} is VALID [2022-02-20 18:15:04,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2; {365#(<= 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 18:15:04,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-02-20 18:15:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:15:04,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297308847] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:15:04,132 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:15:04,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 18:15:04,133 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477214208] [2022-02-20 18:15:04,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:15:04,133 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 7 states have call successors, (7) Word has length 23 [2022-02-20 18:15:04,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:04,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:15:04,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:04,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 18:15:04,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:15:04,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 18:15:04,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:15:04,160 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:15:04,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:04,536 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-02-20 18:15:04,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:15:04,536 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 7 states have call successors, (7) Word has length 23 [2022-02-20 18:15:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:15:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2022-02-20 18:15:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:15:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2022-02-20 18:15:04,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 72 transitions. [2022-02-20 18:15:04,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:04,587 INFO L225 Difference]: With dead ends: 55 [2022-02-20 18:15:04,587 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 18:15:04,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:15:04,588 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:04,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 135 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:15:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 18:15:04,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-02-20 18:15:04,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:04,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 18:15:04,595 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 18:15:04,595 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 18:15:04,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:04,597 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-20 18:15:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-02-20 18:15:04,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:04,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:04,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Second operand 31 states. [2022-02-20 18:15:04,598 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Second operand 31 states. [2022-02-20 18:15:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:04,599 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-20 18:15:04,599 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-02-20 18:15:04,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:04,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:04,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:04,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 18:15:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-02-20 18:15:04,602 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2022-02-20 18:15:04,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:04,602 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-02-20 18:15:04,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:15:04,602 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-02-20 18:15:04,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 18:15:04,612 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:04,612 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:04,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 18:15:04,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:15:04,846 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:04,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:04,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2022-02-20 18:15:04,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:15:04,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565421398] [2022-02-20 18:15:04,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:04,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:15:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:15:04,862 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:15:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:15:04,879 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 18:15:04,880 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:15:04,881 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:15:04,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:15:04,900 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 18:15:04,902 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:15:04,916 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret8 := fibo1(~x~0); [2022-02-20 18:15:04,917 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 18:15:04,920 INFO L158 Benchmark]: Toolchain (without parser) took 3805.10ms. Allocated memory was 86.0MB in the beginning and 148.9MB in the end (delta: 62.9MB). Free memory was 44.9MB in the beginning and 124.7MB in the end (delta: -79.8MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2022-02-20 18:15:04,920 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 86.0MB. Free memory is still 60.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:15:04,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.97ms. Allocated memory was 86.0MB in the beginning and 123.7MB in the end (delta: 37.7MB). Free memory was 44.7MB in the beginning and 94.1MB in the end (delta: -49.5MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2022-02-20 18:15:04,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.22ms. Allocated memory is still 123.7MB. Free memory was 94.1MB in the beginning and 92.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:15:04,921 INFO L158 Benchmark]: Boogie Preprocessor took 26.69ms. Allocated memory is still 123.7MB. Free memory was 92.9MB in the beginning and 92.0MB in the end (delta: 907.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:15:04,921 INFO L158 Benchmark]: RCFGBuilder took 345.20ms. Allocated memory is still 123.7MB. Free memory was 92.0MB in the beginning and 95.6MB in the end (delta: -3.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 18:15:04,922 INFO L158 Benchmark]: TraceAbstraction took 3134.53ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 95.1MB in the beginning and 124.7MB in the end (delta: -29.6MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. [2022-02-20 18:15:04,923 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 86.0MB. Free memory is still 60.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.97ms. Allocated memory was 86.0MB in the beginning and 123.7MB in the end (delta: 37.7MB). Free memory was 44.7MB in the beginning and 94.1MB in the end (delta: -49.5MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.22ms. Allocated memory is still 123.7MB. Free memory was 94.1MB in the beginning and 92.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.69ms. Allocated memory is still 123.7MB. Free memory was 92.9MB in the beginning and 92.0MB in the end (delta: 907.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 345.20ms. Allocated memory is still 123.7MB. Free memory was 92.0MB in the beginning and 95.6MB in the end (delta: -3.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3134.53ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 95.1MB in the beginning and 124.7MB in the end (delta: -29.6MB). Peak memory consumption was 61.0MB. 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 18:15:04,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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_2calls_2-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 2c47a69833f1a958e38c27482b535b2d176258e52297f9899a8926a996c05520 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:15:07,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:15:07,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:15:07,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:15:07,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:15:07,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:15:07,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:15:07,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:15:07,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:15:07,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:15:07,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:15:07,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:15:07,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:15:07,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:15:07,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:15:07,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:15:07,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:15:07,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:15:07,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:15:07,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:15:07,691 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:15:07,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:15:07,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:15:07,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:15:07,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:15:07,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:15:07,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:15:07,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:15:07,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:15:07,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:15:07,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:15:07,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:15:07,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:15:07,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:15:07,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:15:07,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:15:07,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:15:07,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:15:07,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:15:07,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:15:07,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:15:07,712 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 18:15:07,732 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:15:07,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:15:07,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:15:07,734 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:15:07,735 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:15:07,735 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:15:07,736 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:15:07,736 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:15:07,736 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:15:07,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:15:07,737 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:15:07,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:15:07,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:15:07,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:15:07,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:15:07,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:15:07,738 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 18:15:07,738 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 18:15:07,739 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 18:15:07,739 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:15:07,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:15:07,739 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:15:07,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:15:07,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:15:07,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:15:07,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:15:07,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:15:07,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:15:07,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:15:07,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:15:07,741 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 18:15:07,741 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 18:15:07,741 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:15:07,741 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:15:07,742 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:15:07,742 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 18:15:07,742 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.graphml 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 -> 2c47a69833f1a958e38c27482b535b2d176258e52297f9899a8926a996c05520 [2022-02-20 18:15:08,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:15:08,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:15:08,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:15:08,208 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:15:08,219 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:15:08,222 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_2-1.c [2022-02-20 18:15:08,288 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f40f0ec7/bc004915d48d411cae2774e70179e099/FLAGbb02e82cd [2022-02-20 18:15:08,615 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:15:08,615 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_2-1.c [2022-02-20 18:15:08,620 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f40f0ec7/bc004915d48d411cae2774e70179e099/FLAGbb02e82cd [2022-02-20 18:15:09,043 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f40f0ec7/bc004915d48d411cae2774e70179e099 [2022-02-20 18:15:09,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:15:09,054 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:15:09,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:15:09,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:15:09,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:15:09,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:15:09" (1/1) ... [2022-02-20 18:15:09,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60c5a00e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:09, skipping insertion in model container [2022-02-20 18:15:09,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:15:09" (1/1) ... [2022-02-20 18:15:09,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:15:09,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:15:09,258 WARN L230 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_2calls_2-1.c[946,959] [2022-02-20 18:15:09,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:15:09,279 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:15:09,299 WARN L230 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_2calls_2-1.c[946,959] [2022-02-20 18:15:09,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:15:09,346 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:15:09,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:09 WrapperNode [2022-02-20 18:15:09,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:15:09,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:15:09,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:15:09,354 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:15:09,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:09" (1/1) ... [2022-02-20 18:15:09,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:09" (1/1) ... [2022-02-20 18:15:09,375 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-02-20 18:15:09,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:15:09,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:15:09,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:15:09,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:15:09,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:09" (1/1) ... [2022-02-20 18:15:09,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:09" (1/1) ... [2022-02-20 18:15:09,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:09" (1/1) ... [2022-02-20 18:15:09,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:09" (1/1) ... [2022-02-20 18:15:09,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:09" (1/1) ... [2022-02-20 18:15:09,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:09" (1/1) ... [2022-02-20 18:15:09,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:09" (1/1) ... [2022-02-20 18:15:09,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:15:09,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:15:09,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:15:09,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:15:09,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:09" (1/1) ... [2022-02-20 18:15:09,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:15:09,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:15:09,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:15:09,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:15:09,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:15:09,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 18:15:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-02-20 18:15:09,496 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-02-20 18:15:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-02-20 18:15:09,497 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-02-20 18:15:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:15:09,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:15:09,554 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:15:09,556 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:15:09,694 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:15:09,712 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:15:09,712 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:15:09,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:15:09 BoogieIcfgContainer [2022-02-20 18:15:09,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:15:09,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:15:09,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:15:09,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:15:09,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:15:09" (1/3) ... [2022-02-20 18:15:09,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b719b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:15:09, skipping insertion in model container [2022-02-20 18:15:09,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:15:09" (2/3) ... [2022-02-20 18:15:09,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b719b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:15:09, skipping insertion in model container [2022-02-20 18:15:09,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:15:09" (3/3) ... [2022-02-20 18:15:09,719 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-1.c [2022-02-20 18:15:09,722 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:15:09,733 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:15:09,779 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:15:09,787 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:15:09,788 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:15:09,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:15:09,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 18:15:09,831 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:09,831 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:09,832 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:09,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:09,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1014607960, now seen corresponding path program 1 times [2022-02-20 18:15:09,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:15:09,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207231779] [2022-02-20 18:15:09,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:09,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:15:09,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:15:09,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:15:09,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 18:15:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:09,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 18:15:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:09,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:15:10,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {30#true} is VALID [2022-02-20 18:15:10,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2bv32; {38#(= |ULTIMATE.start_main_~x~0#1| (_ bv2 32))} is VALID [2022-02-20 18:15:10,017 INFO L272 TraceCheckUtils]: 2: Hoare triple {38#(= |ULTIMATE.start_main_~x~0#1| (_ bv2 32))} call main_#t~ret8#1 := fibo1(main_~x~0#1); {30#true} is VALID [2022-02-20 18:15:10,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#true} ~n := #in~n; {45#(= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:10,018 INFO L290 TraceCheckUtils]: 4: Hoare triple {45#(= |fibo1_#in~n| fibo1_~n)} assume ~bvslt32(~n, 1bv32);#res := 0bv32; {49#(bvslt |fibo1_#in~n| (_ bv1 32))} is VALID [2022-02-20 18:15:10,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {49#(bvslt |fibo1_#in~n| (_ bv1 32))} assume true; {49#(bvslt |fibo1_#in~n| (_ bv1 32))} is VALID [2022-02-20 18:15:10,020 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {49#(bvslt |fibo1_#in~n| (_ bv1 32))} {38#(= |ULTIMATE.start_main_~x~0#1| (_ bv2 32))} #45#return; {31#false} is VALID [2022-02-20 18:15:10,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#false} main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {31#false} is VALID [2022-02-20 18:15:10,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} assume 1bv32 == main_~result~0#1; {31#false} is VALID [2022-02-20 18:15:10,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 18:15:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:15:10,021 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:15:10,022 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:15:10,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207231779] [2022-02-20 18:15:10,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207231779] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:15:10,022 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:15:10,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:15:10,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807212961] [2022-02-20 18:15:10,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:15:10,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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 [2022-02-20 18:15:10,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:10,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) 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) [2022-02-20 18:15:10,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:10,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:15:10,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:15:10,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:15:10,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:15:10,062 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 4 states have (on average 2.0) 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) [2022-02-20 18:15:10,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:10,236 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 18:15:10,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:15:10,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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 [2022-02-20 18:15:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) 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) [2022-02-20 18:15:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-02-20 18:15:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) 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) [2022-02-20 18:15:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-02-20 18:15:10,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-02-20 18:15:10,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:10,301 INFO L225 Difference]: With dead ends: 37 [2022-02-20 18:15:10,301 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 18:15:10,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:15:10,306 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:10,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 82 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:15:10,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 18:15:10,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 18:15:10,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:10,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:10,328 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:10,328 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:10,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:10,332 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-20 18:15:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 18:15:10,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:10,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:10,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 25 states. [2022-02-20 18:15:10,334 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 25 states. [2022-02-20 18:15:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:10,337 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-20 18:15:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 18:15:10,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:10,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:10,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:10,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-20 18:15:10,341 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 10 [2022-02-20 18:15:10,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:10,342 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-20 18:15:10,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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) [2022-02-20 18:15:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 18:15:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 18:15:10,343 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:10,343 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:10,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 18:15:10,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:15:10,555 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:10,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:10,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2131805067, now seen corresponding path program 1 times [2022-02-20 18:15:10,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:15:10,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58793415] [2022-02-20 18:15:10,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:10,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:15:10,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:15:10,559 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:15:10,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 18:15:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:10,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 18:15:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:10,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:15:10,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {194#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {194#true} is VALID [2022-02-20 18:15:10,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2bv32; {202#(= |ULTIMATE.start_main_~x~0#1| (_ bv2 32))} is VALID [2022-02-20 18:15:10,639 INFO L272 TraceCheckUtils]: 2: Hoare triple {202#(= |ULTIMATE.start_main_~x~0#1| (_ bv2 32))} call main_#t~ret8#1 := fibo1(main_~x~0#1); {194#true} is VALID [2022-02-20 18:15:10,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {194#true} ~n := #in~n; {209#(= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:10,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {209#(= |fibo1_#in~n| fibo1_~n)} assume !~bvslt32(~n, 1bv32); {209#(= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:10,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {209#(= |fibo1_#in~n| fibo1_~n)} assume 1bv32 == ~n;#res := 1bv32; {216#(= |fibo1_#in~n| (_ bv1 32))} is VALID [2022-02-20 18:15:10,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {216#(= |fibo1_#in~n| (_ bv1 32))} assume true; {216#(= |fibo1_#in~n| (_ bv1 32))} is VALID [2022-02-20 18:15:10,642 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {216#(= |fibo1_#in~n| (_ bv1 32))} {202#(= |ULTIMATE.start_main_~x~0#1| (_ bv2 32))} #45#return; {195#false} is VALID [2022-02-20 18:15:10,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {195#false} main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {195#false} is VALID [2022-02-20 18:15:10,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {195#false} assume 1bv32 == main_~result~0#1; {195#false} is VALID [2022-02-20 18:15:10,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-02-20 18:15:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:15:10,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:15:10,643 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:15:10,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58793415] [2022-02-20 18:15:10,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58793415] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:15:10,644 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:15:10,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:15:10,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826692241] [2022-02-20 18:15:10,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:15:10,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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 [2022-02-20 18:15:10,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:10,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) 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) [2022-02-20 18:15:10,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:10,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:15:10,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:15:10,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:15:10,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:15:10,670 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 4 states have (on average 2.25) 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) [2022-02-20 18:15:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:10,836 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-20 18:15:10,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:15:10,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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 [2022-02-20 18:15:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) 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) [2022-02-20 18:15:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 18:15:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) 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) [2022-02-20 18:15:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 18:15:10,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-02-20 18:15:10,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:10,877 INFO L225 Difference]: With dead ends: 31 [2022-02-20 18:15:10,877 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 18:15:10,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:15:10,879 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:10,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 72 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:15:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 18:15:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-02-20 18:15:10,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:10,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:10,883 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:10,884 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:10,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:10,886 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-02-20 18:15:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-20 18:15:10,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:10,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:10,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 27 states. [2022-02-20 18:15:10,887 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 27 states. [2022-02-20 18:15:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:10,889 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-02-20 18:15:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-20 18:15:10,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:10,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:10,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:10,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 18:15:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-20 18:15:10,892 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 11 [2022-02-20 18:15:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:10,893 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-20 18:15:10,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) 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) [2022-02-20 18:15:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 18:15:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 18:15:10,894 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:10,894 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:10,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 18:15:11,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:15:11,126 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:11,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:11,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1494555912, now seen corresponding path program 1 times [2022-02-20 18:15:11,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:15:11,130 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289638633] [2022-02-20 18:15:11,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:11,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:15:11,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:15:11,157 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:15:11,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 18:15:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:11,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 18:15:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:15:11,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:15:11,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {357#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {357#true} is VALID [2022-02-20 18:15:11,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2bv32; {365#(= |ULTIMATE.start_main_~x~0#1| (_ bv2 32))} is VALID [2022-02-20 18:15:11,348 INFO L272 TraceCheckUtils]: 2: Hoare triple {365#(= |ULTIMATE.start_main_~x~0#1| (_ bv2 32))} call main_#t~ret8#1 := fibo1(main_~x~0#1); {357#true} is VALID [2022-02-20 18:15:11,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {357#true} ~n := #in~n; {372#(= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:11,350 INFO L290 TraceCheckUtils]: 4: Hoare triple {372#(= |fibo1_#in~n| fibo1_~n)} assume !~bvslt32(~n, 1bv32); {372#(= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:11,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {372#(= |fibo1_#in~n| fibo1_~n)} assume !(1bv32 == ~n); {372#(= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-20 18:15:11,351 INFO L272 TraceCheckUtils]: 6: Hoare triple {372#(= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~bvsub32(~n, 1bv32)); {357#true} is VALID [2022-02-20 18:15:11,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {357#true} ~n := #in~n; {385#(= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-20 18:15:11,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {385#(= |fibo2_#in~n| fibo2_~n)} assume ~bvslt32(~n, 1bv32);#res := 0bv32; {389#(bvslt |fibo2_#in~n| (_ bv1 32))} is VALID [2022-02-20 18:15:11,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {389#(bvslt |fibo2_#in~n| (_ bv1 32))} assume true; {389#(bvslt |fibo2_#in~n| (_ bv1 32))} is VALID [2022-02-20 18:15:11,353 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {389#(bvslt |fibo2_#in~n| (_ bv1 32))} {372#(= |fibo1_#in~n| fibo1_~n)} #51#return; {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} is VALID [2022-02-20 18:15:11,353 INFO L272 TraceCheckUtils]: 11: Hoare triple {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} call #t~ret5 := fibo2(~bvsub32(~n, 2bv32)); {357#true} is VALID [2022-02-20 18:15:11,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {357#true} ~n := #in~n; {357#true} is VALID [2022-02-20 18:15:11,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {357#true} assume ~bvslt32(~n, 1bv32);#res := 0bv32; {357#true} is VALID [2022-02-20 18:15:11,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {357#true} assume true; {357#true} is VALID [2022-02-20 18:15:11,357 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {357#true} {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} #53#return; {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} is VALID [2022-02-20 18:15:11,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} #res := ~bvadd32(#t~ret4, #t~ret5);havoc #t~ret4;havoc #t~ret5; {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} is VALID [2022-02-20 18:15:11,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} assume true; {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} is VALID [2022-02-20 18:15:11,358 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} {365#(= |ULTIMATE.start_main_~x~0#1| (_ bv2 32))} #45#return; {358#false} is VALID [2022-02-20 18:15:11,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {358#false} main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {358#false} is VALID [2022-02-20 18:15:11,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {358#false} assume 1bv32 == main_~result~0#1; {358#false} is VALID [2022-02-20 18:15:11,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {358#false} assume !false; {358#false} is VALID [2022-02-20 18:15:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:15:11,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:15:11,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {358#false} assume !false; {358#false} is VALID [2022-02-20 18:15:11,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {358#false} assume 1bv32 == main_~result~0#1; {358#false} is VALID [2022-02-20 18:15:11,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {358#false} main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {358#false} is VALID [2022-02-20 18:15:11,771 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} {439#(not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~x~0#1|) (_ bv1 32)))} #45#return; {358#false} is VALID [2022-02-20 18:15:11,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} assume true; {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} is VALID [2022-02-20 18:15:11,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} #res := ~bvadd32(#t~ret4, #t~ret5);havoc #t~ret4;havoc #t~ret5; {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} is VALID [2022-02-20 18:15:11,776 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {357#true} {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} #53#return; {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} is VALID [2022-02-20 18:15:11,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {357#true} assume true; {357#true} is VALID [2022-02-20 18:15:11,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {357#true} assume ~bvslt32(~n, 1bv32);#res := 0bv32; {357#true} is VALID [2022-02-20 18:15:11,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {357#true} ~n := #in~n; {357#true} is VALID [2022-02-20 18:15:11,777 INFO L272 TraceCheckUtils]: 11: Hoare triple {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} call #t~ret5 := fibo2(~bvsub32(~n, 2bv32)); {357#true} is VALID [2022-02-20 18:15:11,778 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {389#(bvslt |fibo2_#in~n| (_ bv1 32))} {467#(or (not (bvslt (bvadd (_ bv4294967295 32) fibo1_~n) (_ bv1 32))) (bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32)))} #51#return; {396#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} is VALID [2022-02-20 18:15:11,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {389#(bvslt |fibo2_#in~n| (_ bv1 32))} assume true; {389#(bvslt |fibo2_#in~n| (_ bv1 32))} is VALID [2022-02-20 18:15:11,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#(or (bvslt |fibo2_#in~n| (_ bv1 32)) (not (bvslt fibo2_~n (_ bv1 32))))} assume ~bvslt32(~n, 1bv32);#res := 0bv32; {389#(bvslt |fibo2_#in~n| (_ bv1 32))} is VALID [2022-02-20 18:15:11,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {357#true} ~n := #in~n; {477#(or (bvslt |fibo2_#in~n| (_ bv1 32)) (not (bvslt fibo2_~n (_ bv1 32))))} is VALID [2022-02-20 18:15:11,781 INFO L272 TraceCheckUtils]: 6: Hoare triple {467#(or (not (bvslt (bvadd (_ bv4294967295 32) fibo1_~n) (_ bv1 32))) (bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32)))} call #t~ret4 := fibo2(~bvsub32(~n, 1bv32)); {357#true} is VALID [2022-02-20 18:15:11,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {467#(or (not (bvslt (bvadd (_ bv4294967295 32) fibo1_~n) (_ bv1 32))) (bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32)))} assume !(1bv32 == ~n); {467#(or (not (bvslt (bvadd (_ bv4294967295 32) fibo1_~n) (_ bv1 32))) (bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32)))} is VALID [2022-02-20 18:15:11,782 INFO L290 TraceCheckUtils]: 4: Hoare triple {467#(or (not (bvslt (bvadd (_ bv4294967295 32) fibo1_~n) (_ bv1 32))) (bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32)))} assume !~bvslt32(~n, 1bv32); {467#(or (not (bvslt (bvadd (_ bv4294967295 32) fibo1_~n) (_ bv1 32))) (bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32)))} is VALID [2022-02-20 18:15:11,783 INFO L290 TraceCheckUtils]: 3: Hoare triple {357#true} ~n := #in~n; {467#(or (not (bvslt (bvadd (_ bv4294967295 32) fibo1_~n) (_ bv1 32))) (bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32)))} is VALID [2022-02-20 18:15:11,783 INFO L272 TraceCheckUtils]: 2: Hoare triple {439#(not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~x~0#1|) (_ bv1 32)))} call main_#t~ret8#1 := fibo1(main_~x~0#1); {357#true} is VALID [2022-02-20 18:15:11,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 2bv32; {439#(not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~x~0#1|) (_ bv1 32)))} is VALID [2022-02-20 18:15:11,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {357#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {357#true} is VALID [2022-02-20 18:15:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:15:11,784 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:15:11,784 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289638633] [2022-02-20 18:15:11,784 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289638633] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:15:11,785 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 18:15:11,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-02-20 18:15:11,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886746668] [2022-02-20 18:15:11,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 18:15:11,785 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 22 [2022-02-20 18:15:11,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:15:11,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.75) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:15:11,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:11,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 18:15:11,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:15:11,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 18:15:11,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:15:11,818 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:15:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:12,274 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-02-20 18:15:12,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:15:12,275 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 22 [2022-02-20 18:15:12,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:15:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:15:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-02-20 18:15:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:15:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-02-20 18:15:12,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2022-02-20 18:15:12,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:15:12,318 INFO L225 Difference]: With dead ends: 37 [2022-02-20 18:15:12,319 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 18:15:12,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:15:12,320 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:15:12,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 89 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:15:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 18:15:12,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-02-20 18:15:12,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:15:12,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-20 18:15:12,325 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-20 18:15:12,325 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-20 18:15:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:12,340 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-02-20 18:15:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-02-20 18:15:12,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:12,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:12,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) Second operand 33 states. [2022-02-20 18:15:12,342 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) Second operand 33 states. [2022-02-20 18:15:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:15:12,345 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-02-20 18:15:12,345 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-02-20 18:15:12,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:15:12,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:15:12,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:15:12,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:15:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-20 18:15:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2022-02-20 18:15:12,348 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 22 [2022-02-20 18:15:12,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:15:12,348 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-02-20 18:15:12,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:15:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-02-20 18:15:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 18:15:12,349 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:15:12,349 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:15:12,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 18:15:12,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:15:12,558 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:15:12,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:15:12,559 INFO L85 PathProgramCache]: Analyzing trace with hash 814571350, now seen corresponding path program 1 times [2022-02-20 18:15:12,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:15:12,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943106400] [2022-02-20 18:15:12,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:15:12,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:15:12,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:15:12,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:15:12,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 18:15:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:15:12,606 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:15:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:15:12,659 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 18:15:12,660 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:15:12,660 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:15:12,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 18:15:12,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:15:12,874 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 18:15:12,876 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:15:12,884 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret8 := fibo1(~x~0); [2022-02-20 18:15:12,888 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 18:15:12,890 INFO L158 Benchmark]: Toolchain (without parser) took 3836.19ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 43.9MB in the beginning and 25.9MB in the end (delta: 18.0MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2022-02-20 18:15:12,891 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 46.1MB. Free memory was 28.4MB in the beginning and 28.4MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:15:12,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.06ms. Allocated memory is still 58.7MB. Free memory was 43.7MB in the beginning and 42.8MB in the end (delta: 979.6kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 18:15:12,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.42ms. Allocated memory is still 58.7MB. Free memory was 42.8MB in the beginning and 41.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:15:12,894 INFO L158 Benchmark]: Boogie Preprocessor took 14.72ms. Allocated memory is still 58.7MB. Free memory was 41.4MB in the beginning and 40.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:15:12,894 INFO L158 Benchmark]: RCFGBuilder took 321.64ms. Allocated memory is still 58.7MB. Free memory was 40.2MB in the beginning and 31.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 18:15:12,895 INFO L158 Benchmark]: TraceAbstraction took 3175.22ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 30.5MB in the beginning and 25.9MB in the end (delta: 4.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 18:15:12,896 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 46.1MB. Free memory was 28.4MB in the beginning and 28.4MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.06ms. Allocated memory is still 58.7MB. Free memory was 43.7MB in the beginning and 42.8MB in the end (delta: 979.6kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.42ms. Allocated memory is still 58.7MB. Free memory was 42.8MB in the beginning and 41.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.72ms. Allocated memory is still 58.7MB. Free memory was 41.4MB in the beginning and 40.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 321.64ms. Allocated memory is still 58.7MB. Free memory was 40.2MB in the beginning and 31.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3175.22ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 30.5MB in the beginning and 25.9MB in the end (delta: 4.6MB). Peak memory consumption was 18.9MB. 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 18:15:12,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator